Method, apparatus, and computer program product for lead assignment

ABSTRACT

Provided herein are systems, methods and computer readable media for assigning leads. An example for method for assigning leads comprises receiving a list of one or more merchants, wherein the one or more merchants comprise a sales value and an indication of an ability to provide a service associated with at least one demanded offer, accessing sales resource data comprising at least one or more sales resources and an associated capacity for contacting one or more merchants, assigning one or more sales resources an assignment probability number, wherein an assignment probability number represents a probability that a sales resource will be randomly assigned a next supply source in an assignment process, adjusting an assignment probability number based on the associated capacity, and assigning at least a portion of the one or more merchants according to at least the assignment probability number of the one or more sales resource and the sales value of the one or more merchants.

CROSS REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.13/826,464, titled “METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FORLEAD ASSIGNMENT’ filed Mar. 14, 2013, which claims priority to U.S.Provisional Patent Application No. 61/730,046, titled “METHOD ANDAPPARATUS FOR MATCHING SUBSCRIBER DEMAND WITH MERCHANT/INVENTORY SUPPLY”filed on Nov. 26, 2012″, and U.S. Provisional Application No.61/709,623, titled “MERCHANT SIDE CROSS-CATEGORY DEAL DIVERSITY”, filedOct. 4, 2012, each of which is hereby incorporated by reference.

The present application is related to U.S. patent application Ser. No.13/803,445, filed Mar. 14, 2013, titled “METHOD, APPARATUS, AND COMPUTERPROGRAM PRODUCT FOR SALES PIPELINE AUTOMATION”, U.S. patent applicationSer. No. 13/826,866, filed Mar. 14, 2013, titled “METHOD, APPARATUS, ANDCOMPUTER PROGRAM PRODUCT FOR CALCULATING A PROVIDER QUALITY SCORE”, U.S.patent application Ser. No. 13/826,757, filed Mar. 14, 2013, titled“METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR DETERMINING APROVIDER RETURN RATE”, U.S. patent application Ser. No. 13/804,403,filed Mar. 14, 2013, titled “METHOD, APPARATUS, AND COMPUTER PROGRAMPRODUCT FOR IDENTIFYING A SERVICE NEED VIA A PROMOTIONAL SYSTEM”, U.S.patent application Ser. No. 13/804,316, filed Mar. 14, 2013, titled“METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR DETERMINING CLOSINGMETRICS”, and U.S. patent application Ser. No. 13/830,243, filed Mar.14, 2013, titled “CAPACITY CALCULATOR”, and U.S. patent application Ser.No. 13/803,275, filed Mar. 14, 2013, titled “MERCHANT SIDECROSS-CATEGORY DEAL DIVERSITY”, each of which is hereby incorporated byreference.

FIELD

Embodiments of the invention relate, generally, to assigning providersto sales resources.

BACKGROUND

Applicant has discovered problems with current methods for forecastingdemand. In some examples, a plurality of manual steps in the process maybe eliminated and/or the resource allocation may be improved. Throughapplied effort, ingenuity, and innovation, Applicant has solved many ofthese identified problems by developing a solution that is embodied bythe present invention, which is described in detail below.

BRIEF SUMMARY

In general, embodiments of the present invention provided herein includesystems, methods and computer readable media for assigning providers tosales resources.

In one embodiment of the present invention a method for assigning leadsis provided. The method comprises receiving a list of one or moremerchants, wherein the one or more merchants comprise a sales value andan indication of an ability to provide a service associated with atleast one demanded offer, accessing sales resource data comprising atleast one or more sales resources and an associated capacity forcontacting one or more merchants, assigning one or more sales resourcesan assignment probability number, wherein an assignment probabilitynumber represents a probability that a sales resource will be randomlyassigned a next supply source in an assignment process, adjusting anassignment probability number based on the associated capacity, andassigning at least a portion of the one or more merchants according toat least the assignment probability number of the one or more salesresource and the sales value of the one or more merchants.

In another embodiment, the method may further comprise assigning a firstsupply source to a first sales resource at random based on theassignment probability of the first sales resource, decreasing theassignment probability number of the first sales resource and adjustingthe capacity of the first sales resource. In another embodiment, thesales resource data further comprises a sales resource expertise scorefor at least one of: category, sub-category, or location, and furthercomprising: adjusting the sales resource probability based on a supplysource and an associated targeted offer. In another embodiment, themethod may further comprise assigning a second lead to a second salesresource at random based on the assignment probability number of thesecond sales resource, decreasing the assignment probability of thesecond sales resource, and adjusting the capacity of the second salesresource.

In another embodiment, the method may further comprise generating aprioritized call list for one or more sales resources, the prioritizedcall list comprising one or more merchants, each supply source unique toan associated sales resource, wherein the one or more merchants areassigned sequentially at random based on the assignment probabilitynumber of each sales resource. In another embodiment, the method mayfurther comprise receiving supply source information or inventoryinformation, wherein the prioritized call list is updated based on thesupply source information or inventory information.

In another embodiment, the method may further comprise adjusting theassignment probability number of each sales resource based on apredetermined portfolio mix and assigned merchants. In anotherembodiment, the method may further comprise adjusting the assignmentprobability number of one or more sales resources based on supply sourcerelationship information.

In another embodiment of the present invention, an apparatus isprovided. The apparatus may comprise at least one processor and at leastone memory including computer program code, the at least one memory andthe computer program code configured to, with the at least oneprocessor, cause the apparatus at least to receive a list of one or moremerchants, wherein the one or more merchants comprise a sales value andan indication of an ability to provide a service associated with atleast one demanded offer, access sales resource data comprising at leastone or more sales resources and an associated capacity for contactingone or more merchants, assign one or more sales resources an assignmentprobability number, wherein an assignment probability number representsa probability that a sales resource will be randomly assigned a nextsupply source in an assignment process, adjust an assignment probabilitynumber based on the associated capacity, and assign at least a portionof the one or more merchants according to at least the assignmentprobability number of the one or more sales resource and the sales valueof the one or more merchants.

In another embodiment, the at least one memory and computer program codeare configured to, with the at least one processor, cause the apparatusto assign a first supply source to a first sales resource at randombased on the assignment probability of the first sales resource,decrease the assignment probability number of the first sales resourceand adjust the capacity of the first sales resource. In anotherembodiment, the sales resource data further comprises a sales resourceexpertise score for at least one of: category, sub-category, orlocation, the at least one memory and computer program code areconfigured to, with the at least one processor, cause the apparatus toadjust the sales resource probability based on a supply source and anassociated targeted offer.

In another embodiment, the at least one memory and computer program codeare configured to, with the at least one processor, cause the apparatusto assign a second lead to a second sales resource at random based onthe assignment probability number of the second sales resource, decreasethe assignment probability of the second sales resource, and adjust thecapacity of the second sales resource.

In another embodiment, the at least one memory and computer program codeare configured to, with the at least one processor, cause the apparatusto generate a prioritized call list for one or more sales resources, theprioritized call list comprising one or more merchants, each supplysource unique to an associated sales resource, wherein the one or moremerchants are assigned sequentially at random based on the assignmentprobability number of each sales resource. In another embodiment, the atleast one memory and computer program code are configured to, with theat least one processor, cause the apparatus to receive supply sourceinformation or inventory information, wherein the prioritized call listis updated based on the supply source information or inventoryinformation. In another embodiment, the at least one memory and computerprogram code are configured to, with the at least one processor, causethe apparatus to adjust the assignment probability number of each salesresource based on a predetermined portfolio mix and assigned merchants.In another embodiment the at least one memory and computer program codeare configured to, with the at least one processor, cause the apparatusto adjusting the assignment probability number of one or more salesresources based on supply source relationship information.

In another embodiment of the present invention a computer programproduct is provided. The computer program product comprises at least onecomputer-readable storage medium having computer-executable program codeinstructions stored therein, the computer-executable program codeinstructions comprising program code instructions for receiving a listof one or more merchants, wherein the one or more merchants comprise asales value and an indication of an ability to provide a serviceassociated with at least one demanded offer, accessing sales resourcedata comprising at least one or more sales resources and an associatedcapacity for contacting one or more merchants, assigning one or moresales resources an assignment probability number, wherein an assignmentprobability number represents a probability that a sales resource willbe randomly assigned a next supply source in an assignment process,adjusting an assignment probability number based on the associatedcapacity, and assigning at least a portion of the one or more merchantsaccording to at least the assignment probability number of the one ormore sales resource and the sales value of the one or more merchants.

In another embodiment, the computer-executable program code portionsfurther comprise program code instructions for assigning a first supplysource to a first sales resource at random based on the assignmentprobability of the first sales resource, decreasing the assignmentprobability number of the first sales resource, and adjusting thecapacity of the first sales resource. In another embodiment, salesresource data further comprises a sales resource expertise score for atleast one of: category, sub-category, or location, and thecomputer-executable program code portions further comprise program codeinstructions for adjusting the sales resource probability based on asupply source and an associated targeted offer.

In another embodiment, the computer-executable program code portionsfurther comprise program code instructions for assigning a second leadto a second sales resource at random based on the assignment probabilitynumber of the second sales resource, decreasing the assignmentprobability of the second sales resource, and adjusting the capacity ofthe second sales resource.

In another embodiment, the computer-executable program code portionsfurther comprise program code instructions for generating a prioritizedcall list for one or more sales resources, the prioritized call listcomprising one or more merchants, each supply source unique to anassociated sales resource, wherein the one or more merchants areassigned sequentially at random based on the assignment probabilitynumber of each sales resource.

In another embodiment, the computer-executable program code portionsfurther comprise program code instructions for receiving supply sourceinformation or inventory information, wherein the prioritized call listis updated based on the supply source information or inventoryinformation. In another embodiment, the computer-executable program codeportions further comprise program code instructions for adjusting theassignment probability number of each sales resource based on apredetermined portfolio mix and assigned merchants. In anotherembodiment, the computer-executable program code portions furthercomprise program code instructions for adjusting the assignmentprobability number of one or more sales resources based on supply sourcerelationship information.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

Having thus described embodiments of the invention in general terms,reference will now be made to the accompanying drawings, which are notnecessarily drawn to scale, and wherein:

FIG. 1 is a flowchart showing an exemplary process for facilitatingsales pipeline automation;

FIG. 2a shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein;

FIG. 2b shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein;

FIG. 2c shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein;

FIG. 3 shows a schematic block diagram of circuitry that can be includedin a computing device in accordance with some embodiments discussedherein;

FIG. 4 shows a flow chart showing an exemplary process of Quantum Leadthat includes analyzing demand and merchant data and providingprioritized merchant data in accordance with some embodiments discussedherein;

FIG. 5 shows a flow chart showing an exemplary process of facilitatingQuantum that includes generating an adjusted demand to a remote devicein accordance with some embodiments discussed herein;

FIG. 6A-D show example graphical user interface displays that may bepresented by various components of systems in accordance with someembodiments discussed herein;

FIG. 7 shows a flow chart showing an exemplary process of facilitatingQuantum Lead that includes identifying new supply in accordance withsome embodiments discussed herein;

FIG. 8 shows a flow chart showing an exemplary process of facilitatingQuantum Lead that includes assigning leads in accordance with someembodiments discussed herein;

FIG. 9 shows an exemplary screenshot of a prioritized call list;

FIG. 10 shows a flowchart showing an exemplary process for calculating aprobability that a consumer may buy a particular virtual offer andgenerating a ranked list of virtual offers, in accordance with someembodiments discussed herein;

FIG. 11 shows a flowchart showing an exemplary process for calculating asupply source quality score, in accordance with some embodimentsdiscussed herein;

FIG. 12 shows a flowchart showing an exemplary process for calculatingan assignment probability number for each of one or more salesresources, in accordance with some embodiments discussed herein; and

FIG. 13 shows a flowchart showing an exemplary process for determiningwhether and when to de-allocate a supply source from a sales resource,in accordance with some embodiments discussed herein.

DETAILED DESCRIPTION

Embodiments of the present invention now will be described more fullyhereinafter with reference to the accompanying drawings, in which some,but not all embodiments of the inventions are shown. Indeed, embodimentsof the invention may be embodied in many different forms and should notbe construed as limited to the embodiments set forth herein; rather,these embodiments are provided so that this disclosure will satisfyapplicable legal requirements. Like numbers refer to like elementsthroughout.

As used herein, the terms “data,” “content,” “information” and similarterms may be used interchangeably to refer to data capable of beingcaptured, transmitted, received, displayed and/or stored in accordancewith various example embodiments. Thus, use of any such terms should notbe taken to limit the spirit and scope of the disclosure. Further, wherea computing device is described herein to receive data from anothercomputing device, it will be appreciated that the data may be receiveddirectly from the another computing device or may be received indirectlyvia one or more intermediary computing devices, such as, for example,one or more servers, relays, routers, network access points, basestations, and/or the like, sometimes referred to herein as a “network.”Similarly, where a computing device is described herein to send data toanother computing device, it will be appreciated that the data may besent directly to the another computing device or may be sent indirectlyvia one or more intermediary computing devices, such as, for example,one or more servers, relays, routers, network access points, basestations, and/or the like.

Overview

The methods, apparatus and computer program products described hereinare operable to automate a sales pipeline by implementing and/orotherwise executing a demand module, a supply identification module, anassignment module and/or the like. In some examples, the demand modulemay be configured to determine a forecasted demand for offers (e.g., anytype of presented or otherwise indicated reward, discount, coupon,credit, deal, incentive, discount, media or the like that is indicativeof an offered value or the like that upon purchase or acceptance resultsin the issuance of an instrument that may be used toward at least aportion of the purchase of particular goods, services and/or experiencesdefined by the offer). The forecasted demand provides or otherwiseenables a prediction of those offers that a consumer (e.g., a client,customer, purchaser, shopper, user or the like who may be in theposition to or does exchange value for one or more offers) will likelypurchase if offered, and, as such, enables the prioritization of thesales of the forecasted or demanded offers, which may result in greaterinterest, revenue, higher margin, offer diversity and/or the like.

In some examples, however, one or more demanded offers may already bepresent in an inventory. In such examples, the method, apparatus andcomputer program product described herein is operable to modify orotherwise adjust the demand to account for a current inventory ofoffers. Other adjustments may also be performed, based on seasonality,economic conditions, geography, climate and/or the like.

Once a set of adjustments has been performed, in some exampleembodiments, one or more merchants (e.g., a provider, business owner,consigner, shopkeeper, tradesperson, vender, operator, entrepreneur,agent, dealer, organization or the like that is in the business of aproviding a good, service or experience to a consumer, facilitating theprovision of a good, service or experience to a consumer and/orotherwise operating in the stream of commerce) may be identified thatmay provide the demanded offer. Merchants that provide the same orsimilar goods, services or experiences may be matched or otherwiseassigned to the demanded offers. As such, a merchant may be assignedzero or more virtual offers.

Using a series of ranking metrics described herein, the merchants may beranked. In some examples, the ranking may be based on expected revenue,business objectives, sales timeline, sales probability, merchantdiversity, offer diversity and/or the like. In some examples, the rankedlist may provide an example ordering in which sales calls may be made.

The ranked list of merchants may then be programmatically assigned toone or more sales resources, such as a sales representative, a salescontractor, a marketing person or team, an email distribution list, aself-service tool, or the like. In some examples, the assignment may bedynamically modified based on current resources, need, diversity,probability to close, time to close, business objectives and/or thelike, while in other examples an assignment may be removed in aninstance in which there is no longer a demand for the particularservice, good or experience provided by the particular merchant.Alternatively or additionally, each merchant or demanded offer may beassigned a value, in such cases the value may be suggestive of a bountyor reward system, such as a commission or a bonus for the salesresource.

Sales Process Automation

By way of further example, FIG. 1 is a block a diagram that illustratesan exemplary process for sales pipeline automation. In general, theprocess 100 may forecast or otherwise determine a demand via the demandmodule 102. The demand illustrates and/or otherwise identifies theoffers a consumer is willing to purchase in a local area (e.g., categoryand/or sub category of a good, service or experience, a price, alocation, a time and/or the like). In some examples, the forecasteddemand may be indicative of demanded offers in the local area, howeverin other examples the demand may be indicative of a demanded good,service or experience in the local area irrespective of an offer.

In order to facilitate the forecasted demand, the demand module 102 isconfigured to generate one or more virtual offers, such as via thetaxonomy model 108 and/or the virtual offer builder 110. Virtual offersare representative of one or more offers that could be offered in alocal area. For example, $25 massages or $10 for $20 at a local clothingstore. Additional description relating to the building the one or moreoffers is further described at least with respect to the virtual offergeneration module 202 in FIG. 2 a.

The virtual offers may then be analyzed to determine the probabilitiesthat a particular consumer, such as a current or past subscriber, wouldpurchase the particular virtual offer, such as via the demandcalculation engine 114. The demand calculation engine 114 may beconfigured to generate or otherwise determine the probabilities based onfor example past purchase history in a consumer database 112, historicdemand for similar offers, search engine results, survey results,current market trends and/or the like. Using the probabilities (e.g.,the probability that each of a plurality of consumers would buy each ofa plurality of virtual offers), a forecasted demand may be generated.Additional description relating to determining the probability that aparticular customer would purchase a particular offer is furtherdescribed at least with respect to the probability generation module 204in FIG. 2 a.

In some example embodiments, the demand module 102 may adjust theforecasted demand based on factors, such as, but not limited toseasonality, economic conditions, holidays, weather and/or the like.Additional description relating to demand adjustment is furtherdescribed at least with respect to the demand adjustment module 206 inFIG. 2a . The demand module 102 is configured to output a forecasteddemand to the supply ID module 104.

In some example embodiments, a supply identification (ID) module 104 isconfigured to ingest the forecasted demand, adjusted demand or acombination thereof. Using the forecasted demand, the supply ID module104 is further configured to reduce or otherwise further modify theforecasted demand based on current offers in an inventory to determine aresidual demand. Additional description relating to residual demandcalculation is further described at least with respect to the residualdemand calculation module 224 in FIG. 2 b.

Using the residual demand, the supply ID module 104 is configured toassign each offer defined by the residual demand to one or moremerchants in an instance in which the merchant is able to provide thesame or similar goods, services and/or experiences as defined by theforecasted demand. In some examples, the one or more merchants may bedetermined based on a global listing of merchants stored in a merchantdatabase. As such, to the extent the merchant provides a good, serviceor experience that matches or is related to a demanded offer, thedemanded offer may be assigned or otherwise linked to that merchant.Each merchant may therefore be assigned zero or more demanded offers asdefined by the residual demand. As such, each demanded offer may beassigned to zero or more merchants.

The supply ID module 104 may then further be configured to assign asales value score to each of the merchants. In some examples, the salesvalue score may be determined according to one or more criteria, such asexpected bookings, quality, risk, a time and/or probability to close acontract and/or the like. Based on the scores, the merchants may beprioritized and output to an assignment module 106. Further descriptionof the sales value score is further described at least in sales valuescore calculation module 228 in FIG. 2b . Using the sales value score,the supply ID module 104 may output a ranked list of merchants to theassignment module 106.

In some example embodiments, the assignment module 106 is configured toreceive a ranked list of merchants. Using the ranked list of merchants,the assignment module 106 may further be configured to assign themerchants in the ranked list of merchants to one or more salesresources. The assignment module 106 may also be configured tore-prioritize and/or re-assign merchants to sales resources according toa predetermined time period, such as daily, weekly or the like. Furtherdescription of lead assignment is further described at least withrespect to lead assignment module 246 in FIG. 2 c.

The assignment module 106 may also be configured to provide aprioritized sales call list for one or more sales resources. In someexamples, the prioritized list may be based on a current businessobjective, a portfolio mix, a priority, a commission and/or the like. Insome examples, the sales list may be dynamically reprioritized based oncurrent sales, a change in business objectives, an inventory change, ademand change and/or the like. Further description of generating aprioritized sales call list is further described at least with respectto prioritized list generation module 258 in FIG. 2 c.

The assignment module 106 may also be configured to provide feedbackand/or updates to one or more of the demand module 102, the supply IDmodule 104, the assignment module 106 or the like. The feedback and/orupdates may be related to a contract being closed, time to close, anumber of calls, a contact person or the like. Further description offeedback and/or updates is further described at least with respect tothe feedback and update module 270 in FIG. 2 c.

Demand Forecasting

FIG. 2a shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with demand module 102shown, for example, in process 100. Demand module 102 may includevirtual offer generation module 202, a probability generation module204, a demand adjustment module 206 and/or the like to generate aforecasted demand or one or more virtual offers. Each block of thecircuit diagrams, and combinations of blocks in the circuit diagrams,may be implemented by special purpose hardware-based computer systemsthat perform the specified functions or steps, or combinations ofspecial purpose hardware and computer instructions.

The virtual offer generation module 202 may utilize input from orotherwise embody a taxonomy model 108 and/or a virtual offer builder 110to generate a virtual offer. In some example embodiments, the taxonomymodel 108 defines a hierarchical structure of service categories andsub-categories that may be found in one or more local or hyper-localareas. For example, the taxonomy model 108 may define “food and dining”as a category and “Italian” as a sub-category. Alternatively oradditionally, the taxonomy model 108 may define a hierarchical structurethat is based on location, sub-locations, and/or hyper-local regions,such as any of country, state, county, city, zip code, neighborhood, orstreet. For example, a location may be “Chicago” and a hyper-localregion may be “north side”. Alternatively or additionally, the taxonomymodel 108 may define a hierarchical structure that is based on targetconsumer categories such as “family fun” or “high octane adventures.”One or more of the sub-categories may then be specific to the targetconsumer category, for example, “children under 5” or “high speed”respectively. Additional sub-categories may be general, such as “dining”or “in your neighborhood”. In another embodiment, the taxonomy model 108may define a hierarchical structure that is based on service. Forexample, “wine/food” or “Swedish massage”. Virtual offer builder 110 maygenerate a virtual offer based on such hierarchical structure, such thata virtual offer may comprise a service, a category and sub-category. Forexample, “wine/food”, “food and dining” and “Italian” may be service,category and sub-category of a virtual offer.

In some example embodiments, the virtual offer builder 110 may beconfigured to construct one or more virtual offers. In some examples,every combination of virtual offers that may be constructed, as definedby a taxonomy model, is constructed. Alternatively or additionally, thevirtual offer generation module 202 may be configured to generatevirtual offers according to a set of guidelines or rules. The guidelinemay be operable to provide limitations on prices or price ranges thatone or more sub-sets of categories and/or sub-categories may be pairedwithin a virtual offer. For example, the virtual offer generation module202 may be configured to limit the generation of a first category and/orfirst sub-category to a first sub-set of price ranges. For example, avirtual offer comprising a category of “food and dining” and asub-category of “pizza” may be limited to prices and/or price rangesunder a predetermined limit, e.g., $100. Whereas a virtual offercomprising a category of “food and dining” and a sub-category of “finedining” may be limited to prices and/or price ranges over apredetermined limit, e.g., $50.

In another example embodiment, the limitations on the generation ofvirtual offers may be made according to prior performance of the virtualoffers at each of one or more prices or price ranges, prior performanceof certain categories and/or the like. Alternatively or additionally,the virtual offer generation module 202 may limit virtual offergeneration to a specific time period (e.g., “spring”, “February”, “next60 days”), a specific location and/or hyper-local region (e.g.,“Chicago” and/or “60602”). In further examples, the virtual offers maybe limited to categories and/or sub categories having merchants in agiven area.

In some example embodiments, the virtual offer generation module 202 mayprovide one or more generated virtual offers to the probabilitygeneration module 204. The probability generation module 204 may beconfigured to determine a probability that a particular consumer maypurchase a particular virtual offer. The probability generation module204 may be configured to access consumer data in a consumer database112. The consumer database 112 may comprise one or more users and userdata related to each of the one or more users that may be used tocalculate a probability that a particular user would buy a particularoffer in a particular time frame for at least a portion of the pluralityof users and for each of the virtual offers. In one example embodiment,the probability generation module 204 may determine a probability that afirst consumer, second customer, an n^(th) customer would buy a firstvirtual offer.

In some example embodiments, the probability generation module 204 mayfurther be configured to generate a ranked user list for each of the oneor more users comprising each of the one or more virtual offers and anassociated calculated probability. In some examples, the probabilitygeneration module 204 may be operable to cast a vote for a particularoffer. For example, a vote may be cast for the top t offers in theranked list. Alternatively or additionally, the vote value may beassigned based on the area in the ranked list and/or the like.

In some examples, a union of the top t offers for each user, the top xoffers based on votes or the like may be used to select demanded offersfrom the set of virtual offers. Given a specific list of demandedoffers, each of the demanded offers may be matched with a forecasteddemand (e.g., in terms of quantity of units, revenue or the like) byaggregating the probabilities that each of the users would purchase theoffer as output by the demand calculation engine 114. Alternatively oradditionally, the output may be ranked, prioritized, diversified, and/ortrimmed. In some example embodiments, a projected revenue value may becalculated for each virtual offer based on prior performance data perunit and an estimated number of units to be sold. Based on the revenuecalculation, the one or more virtual offers by the projected revenue.

The demand adjustment module 206 may be configured to input the list ofdemanded offers and provide one or more adjustments based on diversity,portfolio mix, price mix, hyper-local constraints, prior performance,context information or the like using a prior performance database 210,a historical contextual information 212. In some example embodiments,the demand adjustment module 206 may apply a diversity adjustment. Thediversity adjustment may comprise user-level diversity adjustment (e.g.,individual consumer probabilities are adjusted based on predeterminedconstraints, such as user may have a 40% “food and dining” maximum),aggregated output level (e.g., forecasted demand is adjusted topredetermined constraints, such as a maximum of 40% food and dining, 30%health and beauty and/or the like) and/or the like. Alternatively oradditionally, the adjustment may take into account a category mix, suchas by selecting a certain percentage of offers based on the ranked listaccording to a set percentage, a price mix or the like.

In some example embodiments, the demand adjustment module 206 may beconfigured to adjust the forecasted demand according to priorperformance. For example, specific offers may have outperformed orunderperformed calculated demand of a related virtual offer in a pastoffering, indicating that the demand for the related virtual offer maybe more accurately represented by a higher or lower demand. In suchcases, the demand adjustment module 206 may adjust the forecasted demandbased on the historic data.

In some example embodiments, the demand adjustment module 206 may beconfigured to adjust a demand of one or more virtual offers according tocontext information, such as seasonality, discrete weather events,economic conditions and/or other recurring events. For example, demandfor one or more categories or sub-categories may be adjusted accordingto seasonality or a specific season (e.g., adjust “ski” virtual offersupward in late fall or winter and adjust down in spring), rainfall(e.g., adjust “outdoor virtual offers during above average rainfallperiods) and/or the like. In some example embodiments, specific eventsmay cause adjustment (e.g., adjust “golf” virtual offers during timeperiods when golf events are happening, such as the U.S. Open and/or inlocations or hyper-local regions where golf events are taking place,such as Rochester, N.Y. during the PGA championship 2013.).

The demand adjustment module 206 may therefore be configured to outputone or more virtual offers, each with a corresponding demand. Thecorresponding demand may include demand amounts that may have beenadjusted based on any one or more of the aforementioned factors. Thecorresponding demand may also include demand amounts that have notadjusted by any of the aforementioned factors. As such, the collectivedemand information output by probability generation module 204 isreferred to as forecasted demand herein.

Alternatively or additionally, demand may be forecasted using historicalconversion rates for each potential virtual offer and each knownconsumer, top categories or sub categories rank ordered by performancemetrics such as Engaged User Profit Per Thousand (ePPM) or the like,search engine data, use of a website that provides the one or moreoffers, subscription data, historical sales, sales in the market placeand/or the like. In some examples, offer related keywords on searchengines click through to an offer can be leveraged as a signal of demand(e.g., a model that translates or otherwise correlates searches tooffers sold). In some examples, the use of a website or mobileapplication that displays or otherwise advertises available offers maybe tracked as an exogenous source of demand and can be used inidentifying not only the current demand, but also for identifying highdemand offers that are not currently stocked. Each of these demandforecasting methods may be used in conjunction with each of the otherdemand forecasting methods as well as may be used alone.

Supply Identification

FIG. 2b shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with Supply ID module 104of process 100 that is configured to identify one or more merchants thatare able to provide goods, services or experiences to meet a forecasteddemand. In some example embodiments, the supply ID module 104 maycomprise a demand input module 220, a residual demand calculation module224, a sales value score calculation module 228, and/or a merchantprioritization module 238. Each block of the circuit diagram, andcombinations of blocks in the circuit diagram, may be implemented byspecial purpose hardware-based computer systems that perform thespecified functions or steps, or combinations of special purposehardware and computer instructions.

In some example embodiments, the demand input module 220 may beconfigured to receive a forecasted demand, which may be input from oneof the demand module 102, a demand database 222 and/or the like. Theforecasted demand may be one or more virtual offers and an associateddemanded quantity, a demand for one or more goods, services orexperiences and/or the like. In some examples, the associated demandedquantity may be in units, revenue, profits, or the like.

In some example embodiments, the residual demand calculation module 224may be configured to receive a forecasted demand that is input via thedemand input module 220 and calculate a residual demand by subtractingexisting inventory from the forecasted demand. In some exampleembodiments, only those offers in inventory matching each of thecategory, sub-category, location, and price or price range may besubtracted from the demand. Alternatively or additionally, predeterminedsubstitutions may be made (e.g., where one or more of category,sub-category, location, hyper-local region, and price range may bedifferent) and the predetermined substitutions may specify specificallowable substitution for particular categories, sub-categories,locations, hyper-local regions, and/or price ranges. In some examples,similar categories or sub-categories or any other facet of the virtualoffer may also reduce demand.

In some example embodiments, specific guidelines may be utilized indetermining which particular offers in a current inventory may beconsidered. In some example embodiments, when determining residualdemand, only those offers in current inventory that are available for anentire time frame of forecasted demand may be considered. For example,if a first virtual offer comprises a first demand where demand wascalculated for one month, only those offers in current inventoryavailable for the one month period are considered in calculating aresidual demand. Alternatively or additionally, when an offer is incurrent inventory, a determination may be made to calculate how manyunits of the offer are likely to be sold, using for example priorpurchase history, other historic data, current offers and/or the like,and only that number calculated may be utilized when calculatingresidual demand. For example, if 200 units of an offer featuring“personal training sessions” in a local area are available in localinventory, but based on prior purchase history, only 100 are determinedas likely to sell, residual demand may be calculated using the 100 unitslikely to sell instead of the 200 units in the current inventory.

In some example embodiments, penalties may be applied to offers incurrent inventory based on a time frame that they have been available orsitting in inventory. Penalties may also be applied based on priorexposure or seasonality also. For example, 400 units of offer for“American Food” with a sub-category “Burgers” may be in currentinventory. The 400 units may be utilized in calculating residual demand,or the 400 units may be discounted based on the time spent in inventory(e.g., 20% per 3 months), prior exposure (e.g., 20% discount for eachmonth it's been featured), and/or seasonality (20% discount in thesummer). After applying the penalties, less than the 400 available unitsmay be considered when calculating residual demand.

Alternatively or additionally, in some example embodiments, beforecalculating a residual demand based on current inventory, the merchantsin the current inventory are provided to the sales value scorecalculation module 228. In an instance in which a sales value score fora merchant satisfies a predetermined threshold or ranking, then theinventory provided by that merchant would be considered in calculatingresidual demand.

Using the residual demand, the supply ID module 104 is configured toassign each offer defined by the residual demand to one or moremerchants in an instance in which the merchant is able to provide goods,services and/or experiences as defined by the merchant demand. In someexamples, the one or more merchants may be determined based on a globallisting of merchants stored in a merchant database. As such, to theextent the merchant provides a good, service or experience that matchesor is related to a demanded offer, the demanded offer may be assigned orotherwise linked to that merchant. Each merchant may therefore beassigned zero or more demanded offers as defined by the residual demand.

In some example embodiments, a sales value score calculation module 228is configured to input the listing of merchants and then may calculateone or more scores related to a merchant. In some examples, the salesvalue calculation module may be configured to calculate a merchantquality score, a risk potential, a probability to close, a time to closeand/or the like. The sales value score calculation module 228 may alsobe configured to calculate one or more of a quality score, an expectedbooking amount, a risk potential, a time to close, or a probability toclose for one or more merchants. The sales value score calculationmodule 228 may utilize a quality score calculator 230 to calculate thequality score, an expecting booking calculator 232 to calculate theexpecting bookings, a time to close calculator 234 to calculate a timeto close, and a probability of close calculator 236 to calculate aprobability to close. The sales value score calculation module 228 maybe configured to access a merchant database, including one or morefactors related to one or more merchants in order to calculate the salesvalue score of a respective merchant.

In some examples, a merchant quality score indicates a predicative valuethat is indicative of how well a merchant would perform during an offerand how consumers would react to the offer. The merchant quality scoremay include factors such as reviews from a plurality of internet sites(e.g., Yelp®, etc.), likes (e.g., Facebook® likes), quality of website,prior offer performance(s), competitor offers, prior performance ofrelated merchants, and/or Hotspots. For example, a decision model may beused to generate a merchant quality score. As such, if a merchant has atleast an average of 3.0 stars over five reviews, then a merchant mayreceive a merchant quality score of between 6-10 depending on theoverall star average, number of reviews and social media like. In otherexamples, a merchant without 3.0 stars over five reviews may receive ahigh merchant quality score (e.g. 8) if that merchant has a large numberof likes, a positive review from a predetermined acceptable sourceand/or the like.

In some examples, a risk potential may indicate the risk that a merchantmay pose, such as to refund rate, complaints and/or the like. Riskpotential may be calculated based on the business type, credit score,age, capacity, judgments, Better Business Bureau rating, etc. RiskPotential may also predict a refund or return rate of a potentialmerchant offering. In one embodiment, providers may be classified as“good” providers defined as those likely to have return rates less thana predetermined amount (e.g., 10%) and “bad” providers defined as thoseproviders likely to have return rates greater than a predeterminedamount. In general, the process of classifying the providers may accessand/or capture internal, external and web data related to a providerincluding existing return rates. The data may then be normalized andsupplied to a classifying model as attribute data. The process may theninclude training the classifying model to recognize one or more patternsindicative of a return rate of a provider in accordance with theattribute data. When given a provider and corresponding attribute data,the process may then identify a class of the provider in accordance witha plurality of corresponding attribute data, wherein the identificationis determined based on one or more patterns determinative of a returnrate by the classifying model. The corresponding attribute data maycomprise one or more of category data, sub-category data, competitorfeature data, time data, financial stability risk data, median creditdata, count of judgment data, risk level data, or web data (e.g.,reviews, review scores, “likes” or the like).

The probability to close represents a probability of a merchantcommitting their inventory, such as signing a contract. Probability toclose and time to close may be based on in combination, but not limitedto, a lead source, such as for example a “warm lead” versus a “coldcall”, quality of the lead source, merchant attributes, stage of close,interface time, talk time, past feature history data, past featureperformance(s), high prior satisfaction, an upcoming expiration of anoffer, whether the merchant is a new or existing customer, and/orwhether the merchant has adopted other services. A probability to closeand/or a time to close may be calculated based on a logistic regressiontool, a model and/or the like. In one example, a probability to closeindicates the probability that a particular provider of the one or moreproviders will contract with a promotion service to offer a promotion,wherein the promotion is offered to a consumer for purchase from thepromotion service in exchange for an instrument. The time to close maybe calculated as a number of days from a current date, or date ofreceipt of the sales lead, for example

In one embodiment, in order to facilitate a calculation of a probabilityto close and/or a time to close, the promotional system may beconfigured to receive a sales lead comprising an indication of aprovider, and at least one of a provider category, a lead source, orhistorical data relating to the one or more providers as well asreceive, calculate or otherwise generate a series of metrics about aproviders, a good, a service, an experience, a category, a sub-category,a location, a time period and/or the like. A sales lead may, in someembodiments, be generated or received from a third party system or thelike. The sales lead may include any of a provider name, an individualcontact at the provider (e.g., manager), address, category and/orsubcategory of the provider and/or services offered by the provider(such as food and drink, or salon services) and/or the like.Additionally or alternatively, in some embodiments, the sales lead mayinclude information regarding a specific promotion with which to targetthe provider. As such, the sales lead may include a promotionspecifically designed for the provider, or a provider may bespecifically targeted to honor a preconceived promotion.

In some examples, the sales value score calculation module 228 maycalculate a prioritization score that is a function of one or more ofthe merchant quality score, the risk potential, a probability of closingand a time to close for each demanded offer. A sales value score maythen be calculated, which is a function of the prioritization score, anexpecting bookings amount and/or urgency. For example, a provider thatis identified as able to provide more bookings (e.g., meet more residualdemand), may have a higher sales value score than a second provider whoscores higher on prioritization.

In some example embodiments, a merchant prioritization module 238 may beconfigured to receive a listing of one or more merchants identified asable to meet a portion of the residual demand and a corresponding salesvalue score for each merchant from the sales value score calculationmodule 228.

In some example embodiments, the merchant prioritization module 238 maybe configured to receive one or more merchants, a corresponding salesvalue score and a list of each virtual offer that each of the merchantsis identified as able to meet at least a portion of the demand for andwhat portion. The merchant prioritization module 238 may be configuredto determine a priority of the one or more merchants. The one or moremerchants may then be rankable based on the priority score within aspecific virtual offer or by the sales value score given a list ofvirtual offers that may be fulfilled. In some example embodiments, themerchant prioritization module 238 may prioritize the merchants andapply an adjustment based on a portfolio score. The portfolio score maybe a diversity constraint from the portfolio mix generator 240. Themerchant prioritization module 238 may be configured to receive inputfrom or access the portfolio mix generator 240 regarding offerdiversity. Offer diversity may comprise a predetermined mix. Theportfolio score may give pre-determined weight to specific categories,sub-categories, locations, or price ranges based on one or morepredetermined business objectives. The sales value score calculationmodule 228 is therefore configured to output a ranked list of merchants.

Assignment

FIG. 2c shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with assignment module 106in process 100. The assignment module 106 may comprise a prioritizedmerchant input module 242, a lead assignment module 246, a prioritizedlist generation module 258, a feedback and/or an update module 270. Eachblock of the circuit diagrams, and combinations of blocks in the circuitdiagrams, may be implemented by special purpose hardware-based computersystems that perform the specified functions or steps, or combinationsof special purpose hardware and computer instructions.

In some example embodiments, the prioritized merchant input module 242may be configured to receive a prioritized or otherwise ranked listcomprising one or more merchants. The prioritized list may be receivedfrom a prioritized merchant database 244, the supply ID module 104and/or the like. The prioritized list may comprise the listing ofmerchants and one or more of a sales value score, a priority score, aquality score, a risk potential, an expected booking score, a time toclose score, a probability to close score, an expected revenue and/orthe like. The prioritized list may also comprise a list of each of oneor more virtual offers associated with one or more of the merchants.

In some example embodiments, the lead assignment module 246 may beconfigured to ingest the prioritized list and further may be configuredto access sales resource data (e.g., resources, capacity, efficiency, asales resource expertise score for at least one of: category,sub-category, or location, etc.) to assign the merchants to the salesresources. In some examples, the lead assignment module 246 may beconfigured to utilize a sales resource database 248 to access the salesresource data. Alternatively or additionally, the lead assignment module246 may also be configured to access information related to anassociated capacity 250, an associated experience 252, an associatedexpertise 254 and/or an associated merchant mix 256 of one or more salesresources.

In some example embodiments, the lead assignment module 246 may also beconfigured to assign one or more sales resources an assignmentprobability number, wherein an assignment probability number representsa probability that a sales resource will be randomly assigned to a nextmerchant in an assignment process. The assignment probability number maybe calculated or assigned based on at least one of the associatedcapacity, the associated experience, the associated expertise, theassociated merchant mix of a sales resource, or any combination thereof.As such, the lead assignment module 246 may assign merchants to salesresources based on a weighted random allocation, such as based anassignment probability number associated with each of one or more salesresources.

In some example embodiments, the lead assignment module 246 may beconfigured to adjust an assignment probability number based on theassociated capacity, the associated experience, the associatedexpertise, the associated merchant mix, the merchant, an offer or thelike. Alternatively or additionally, before an assignment is made and/orafter a merchant is assigned to a sales resource, the associatedcapacity, the associated experience, the associated expertise, and/orthe associated merchant mix of a sales resource may be updated,re-calculated, and/or re-assigned by the lead assignment module 246. Theassignment probability number may then also be updated, re-calculated,and/or re-assigned.

The lead assignment module 246 may also be configured to assign at leasta portion of the one or more merchants according to at least theassignment probability number of the one or more sales resources, thesales value of the one or more merchants and/or the like. As describedabove, after an assignment is made, the associated capacity, theassociated experience, the associated expertise, the associated merchantmix of a sales resource, and/or any combination thereof may be updated,re-calculated, and/or re-assigned. The assignment probability number maythen be updated, re-calculated, and/or re-assigned.

As such and by way of example, in some example embodiments, the leadassignment module 246 may be configured to assign a first merchant to afirst sales resource at random based on the assignment probability ofthe first sales resource, decrease the assignment probability number ofthe first sales resource and adjust the capacity of the first salesresource. In some example embodiments, after a first merchant isassigned to a first sales resource, a second merchant may need to beassigned. The lead assignment module 246 may be configured to assign asecond lead to a second sales resource based on the assignmentprobability number of the second sales resource. The lead assignmentmodule 246 may then decrease the assignment probability of the secondsales resource and adjust at least one of the associated capacity, theassociated experience, the associated expertise, the associated merchantmix of the second sales resource, or any combination thereof.

In some example embodiments, the lead assignment module 246 may beconfigured to adjust the assignment probability number of one or moresales resources based on a predetermined portfolio mix and/or assignedmerchants. For example, where a first sales resource is assigned a firstmerchant and the merchant is associated with an ability to supply aportion of a virtual offer in a first category and/or a firstsub-category, the assignment probability number of the first salesresource may be adjusted when an subsequent merchant is being assignedso as to keep the portfolio mix of the first sales resource compliantwith a predetermined portfolio mix. In some example embodiments, thelead assignment module 246 may be configured adjust the assignmentprobability number of one or more sales resources based on merchantrelationship information. For example, where a first sales resource hasprior experience with a first merchant, the assignment probabilitynumber may be adjusted based on the outcome of that experience (e.g.,upward if the experience was positive and downward if the experience wasnegative).

In some example embodiments, the prioritized list generation module 258may be configured to generate a prioritized call list for one or moresales resources. The prioritized call list of one or more merchants. Insome examples, a merchant is only assigned to a single sales resource.Alternatively or additionally, the prioritized list generation module258 may be configured to access and/or include, in the prioritized list,at least one of contact information 260, a specific offer (including oneor more of category, sub-category), quantity, price, and/or price range,a rating or bounty score, context or a reason for inclusion or anycombination thereof.

In some example embodiments, the prioritized list generation module 258may be configured to receive merchant information and/or inventoryinformation, and the prioritized call list may be updated based on themerchant information or inventory information. For example, in aninstance in which a sales resource contacts a merchant and learns thatthe contact person, the merchant hours, phone number or the like haschanged, the sales resource may update the information accordingly.

In some example embodiments, the prioritized list generation module 258may be configured to re-assign merchants according to predeterminedmetrics. For example, a merchant may be de-allocated from a first salesresources and re-assigned (1) if a sales resource has made no contactand/or has no activity with a merchant for a predetermined period oftime, the predetermined period of time may be based on merchantinformation such as lead source; (2) if a sales resource has made nocontact and/or made no activity within a predetermined period of timefrom a previous activity; and (3) if a sales resource has no tractionactivity (e.g., 5 minutes of contact) within a predetermined period oftime. A merchant may also be reassigned if a sales resource has notclosed a contract within a predetermined period of time, thepredetermined period of time based on a merchant ranking. A merchant mayalso be reassigned if a sales resource has closed a first contract, buthas not closed a second contract within a predetermined period of timefrom expiration, the predetermined period of time based on a merchantranking.

In some example embodiments, the feedback and update module 270 may beconfigured to receive feedback and/or updated information from the salesresources. The feedback and update module 270 may be configured toprovide that information to other sources. For example, when a contractis closed, information related to the process and/or the contractdetails may be provided to the inventory database 226, the merchantdatabase, the demand database 222, or any other information source.Specifically, for example, the feedback and update module 270 mayprovide a units value for a specific service related to an offer (e.g.,300 units for a category “massage”, sub-category “back”, location“28202”, and price range “$50-$75”) to the inventory database. Thefeedback and update module 270 may provide information related to time,a number of calls, a contact person or the like to the merchantdatabase, which may later be accessed in re-calculating, re-adjusting,or re-assigning a sales value score, a probability to close, a time toclose, or any combination thereof.

In some examples, the feedback and update module 270 module may beconfigured to track metrics that measure the overall improvement made inthe pipeline. Such metrics may include, but are not limited to purchaseorder fill rate, lead time for filing a purchase order, lead conversionrate, demand fulfillment error, demand forecast error, gross revenue,aggregate conversion rate, number of unique purchasers and/or the like.

Promotion and Marketing System

FIG. 3 illustrates an example network architecture for a system inaccordance with some embodiments discussed herein. System 300 mayinclude one or more devices and sub-systems that are configured toimplement some of the example embodiments discussed herein. For example,system 300 may include promotional system 310, which may include, forexample, a processor 302, memory 304, a communications interface 306,and a user interface (not shown). Memory 304 may include promotionalcomputing device 312.

Promotional system 310 can be coupled to one or more salesperson devices340A-340Z, a search engine system 342, one or more consumer devices344A-344N, a 3^(rd) party server 346, and/or one or more merchantdevices 348A-348M via network 350. In this regard, network 350 mayinclude any wired or wireless communication network including, forexample, a wired or wireless local area network (LAN), personal areanetwork (PAN), metropolitan area network (MAN), wide area network (WAN),or the like, as well as any hardware, software and/or firmware requiredto implement it (such as, e.g., network routers, etc.). For example,network 350 may include a cellular telephone, an 802.11, 802.16, 802.20,and/or WiMax network. Further, the network 350 may include a publicnetwork, such as the Internet, a private network, such as an intranet,or combinations thereof, and may utilize a variety of networkingprotocols now available or later developed including, but not limited toTCP/IP based networking protocols. Furthermore, Promotional system 310can be coupled to one or more salesperson devices 340A-340Z directly viaany wired or wireless communication network including, for example, awired or wireless local area network (LAN), personal area network (PAN),metropolitan area network (MAN), wide area network (WAN), or the like,as well as any hardware, software and/or firmware required to implementit.

Salesperson devices 340A-340Z, consumer devices 344A-344N, and/ormerchant devices 348A-348M may each be implemented as a personalcomputer and/or other networked device, such as a cellular phone, a“smartphone”, a tablet computer, mobile device, etc., that may be usedfor any suitable purpose in addition to buying or selling offers. Thedepiction in FIG. 3 of “N” consumers, “M” merchants, and “Z”salespersons is merely for illustration purposes. System 300 may alsoinclude at least one search engine system 342 and/or third party server346, among other things.

Memory 304 of promotional system 310 may include Promotional computingdevice 312, a consumer database 332, a virtual offer engine 334, offerinventory 336, and merchant database 338 and/or other programs and datarepositories 330. Promotional computing device 312 can be any suitablenetwork server and/or other type of processing device. Consumer database332, virtual offer engine 334, offer inventory 336, merchant database338 and/or other programs and data repositories 330 may be any suitablenetwork database configured to store offer parameter data, consumeraccount information, merchant account information and/or analytics data,such as that discussed herein. In this regard, promotional system 310may include, for example, at least one backend data server, networkdatabase, cloud computing device, among other things.

Regarding promotional system 310, FIG. 3 shows a schematic block diagramof circuitry, some or all of which may be included. As illustrated inFIG. 3, in accordance with some example embodiments, the circuitry canincludes various means, such as processor 302, memory 304,communications interface 306, and/or input/output module 308. Asreferred to herein, “module” includes hardware, software and/or firmwareconfigured to perform one or more particular functions. In this regard,the means of the merchant device's circuitry as described herein may beembodied as, for example, circuitry, hardware elements (e.g., a suitablyprogrammed processor, combinational logic circuit, and/or the like), acomputer program product comprising computer-readable programinstructions stored on a non-transitory computer-readable medium (e.g.,memory 304) that is executable by a suitably configured processingdevice (e.g., processor 302), or some combination thereof.

In addition, promotional system 310 may comprise one or more distinctcomputing systems/devices and may span distributed locations. In otherexample embodiments, a pre-processing module or other module thatrequires heavy computational load may be configured to perform thatcomputational load and thus may be on a remote device or server.Furthermore, each block shown may represent one or more such blocks asappropriate to a specific example embodiment. In some cases one or moreof the blocks may be combined with other blocks.

Processor 302 may, for example, be embodied as various means includingone or more microprocessors with accompanying digital signalprocessor(s), one or more processor(s) without an accompanying digitalsignal processor, one or more coprocessors, one or more multi-coreprocessors, one or more controllers, processing circuitry, one or morecomputers, various other processing elements including integratedcircuits such as, for example, an application specific integratedcircuit (ASIC) or field programmable gate array (FPGA), or somecombination thereof. Accordingly, although illustrated in FIG. 3 as asingle processor, in some embodiments, processor 302 comprises aplurality of processors. The plurality of processors may be embodied ona single computing device or may be distributed across a plurality ofcomputing devices collectively. The plurality of processors may be inoperative communication with each other and may be collectivelyconfigured to perform one or more functionalities of promotional system310 as described herein. In an example embodiment, processor 302 isconfigured to execute instructions stored in memory 304 or otherwiseaccessible to processor 302. These instructions, when executed byprocessor 302, may cause promotional system 310 to perform one or moreof the functionalities as described herein.

Whether configured by hardware, firmware/software methods, or by acombination thereof, processor 302 may comprise an entity capable ofperforming operations according to embodiments of the present inventionwhile configured accordingly. Thus, for example, when processor 302 isembodied as an ASIC, FPGA or the like, processor 302 may comprisespecifically configured hardware for conducting one or more operationsdescribed herein. Alternatively, as another example, when processor 302is embodied as an executor of instructions, such as may be stored inmemory 304, the instructions may specifically configure processor 302 toperform one or more algorithms and operations described herein, such asthose discussed in connection with FIGS. 4, 5, 7, and 8.

Memory 304 may comprise, for example, volatile memory, non-volatilememory, or some combination thereof. Although illustrated in FIG. 3 as asingle memory, memory 304 may comprise a plurality of memory components.The plurality of memory components may be embodied on a single computingdevice or distributed across a plurality of computing devices. Invarious embodiments, memory 304 may comprise, for example, a hard disk,random access memory, cache memory, flash memory, a compact disc readonly memory (CD-ROM), digital versatile disc read only memory (DVD-ROM),an optical disc, circuitry configured to store information, or somecombination thereof. Memory 304 may be configured to store information,data (including offer parameter data, consumer data, inventory dataand/or analytics data), applications, instructions, or the like forenabling promotional system 310 to carry out various functions inaccordance with example embodiments of the present invention. Forexample, in at least some embodiments, memory 304 is configured tobuffer input data for processing by processor 302. Alternatively oradditionally, in at least some embodiments, memory 304 is configured tostore program instructions for execution by processor 302. Memory 304may store information in the form of static and/or dynamic information.This stored information may be stored and/or used by salesperson device340 during the course of performing its functionalities.

Communications interface 306 may be embodied as any device or meansembodied in circuitry, hardware, a computer program product comprisingcomputer readable program instructions stored on a computer readablemedium (e.g., memory 304) and executed by a processing device (e.g.,processor 302), or a combination thereof that is configured to receiveand/or transmit data from/to another device, such as, for example,salesperson device 340, consumer device 344, merchant device 348 and/orthe like. In some embodiments, communications interface 306 (like othercomponents discussed herein) can be at least partially embodied as orotherwise controlled by processor 302. In this regard, communicationsinterface 306 may be in communication with processor 302, such as via abus. Communications interface 306 may include, for example, an antenna,a transmitter, a receiver, a transceiver, network interface card and/orsupporting hardware and/or firmware/software for enabling communicationswith another computing device. Communications interface 306 may beconfigured to receive and/or transmit any data that may be stored bymemory 304 using any protocol that may be used for communicationsbetween computing devices. Communications interface 306 may,alternatively or additionally, be in communication with the memory 304,input/output module 308 and/or any other component of promotional system310, such as via a bus.

Input/output module 308 may be in communication with processor 302 toreceive an indication of a user input and/or to provide an audible,visual, mechanical, or other output to a user (e.g., merchant and/orconsumer). As such, input/output module 308 may include support, forexample, for a keyboard, a mouse, a joystick, a display, a touch screendisplay, a microphone, a speaker, a RFID reader, credit card reader,barcode reader, biometric scanner, and/or other input/output mechanismsas represented by 308. Input/output module 308 may be in communicationwith the memory 304, communications interface 306, and/or any othercomponent(s), such as via a bus. Although more than one input/outputmodule and/or other component can be included in promotional system 310,only one is shown in FIG. 3 to avoid overcomplicating the drawing (likethe other components discussed herein).

FIG. 3 also shows an example circuitry that may be included inpromotional computing device 312, which may be configured to perform theanalysis, calculation, management and/or other functionality discussedin connection with promotional system 310. In this manner, from themerchant's perspective, promotional computing device 312 may providecloud computing functionality and services to the merchant. Asillustrated in FIG. 3 and in accordance with some example embodiments,promotional computing device 312 can includes various means, such asdemand module 102, supply ID module 104, and/or assignment module 106.

Demand module 102 may be included and configured to perform thefunctionality discussed herein related to generating, calculating,adjusting, managing, and/or editing demand. In some embodiments, some orall of the functionality of generating, calculating, adjusting and/orediting demand may be performed by processor 302. In this regard, theexample processes and algorithms discussed herein can be performed by atleast one processor 302 and/or demand module 102. For example,non-transitory computer readable media can be configured to storefirmware, one or more application programs, and/or other software, whichinclude instructions and other computer-readable program code portionsthat can be executed to control each processor (e.g., processor 302and/or demand module 102) of the components of promotional computingdevice 312 to implement various operations, including the examples shownabove. As such, a series of computer-readable program code portions areembodied in one or more computer program products and can be used, witha computing device, server, and/or other programmable apparatus, toproduce machine-implemented processes.

For example, demand module 102 may be configured to receive virtualoffers and apply current consumer and/or subscriber information in orderto calculate a forecasted demand. Alternatively or additionally, thedemand module 102 can be configured to adjust demand based on currentinventory and/or external factors. As a result of this calculation andadjustment, demand module 102 can be configured to output a forecasteddemand.

The demand module 102 may be configured to access consumer data, such asfrom database 332, comprising one or more users and user data related toeach of the one or more users and calculate a probability that aparticular user would buy a particular offer in a particular time framefor at least a portion of the plurality of users and for each of thevirtual offers. The demand module 102 may also be configured to access aprogram 330 that may calculate a probability that a specific individualconsumer may purchase a specific virtual offer. The demand module 102may be configured to aggregate the probabilities, for each of one ormore virtual offers, and each of one or more consumers.

Supply ID module 104 can be configured to receive a forecasted demandand access a merchant database for the purpose of identifying merchantscapable of meeting the demand. In order to identify merchants capable ofmeeting this demand, the supply ID module 104 may be configured tocalculate merchant value, calculate a merchant quality score, calculatea risk potential, calculate a probability to close, and calculate a timeto close. Alternatively or additionally, the supply ID module 104 can beconfigured to prioritize the merchants based on the aforementionedfactors. For example, supply ID module 104 can be the component ofpromotional computing device 312 that is configured to receive aninventory adjusted demand, access a merchant database, and identifyand/or prioritize the merchants in such a way as to convey to a salesteam and/or salesperson which merchants offer the most value, withregard to time spent, in fulfilling the inventory adjusted demand. Thesupply ID module 104 may be configured to calculate one or more metricsrelated to a merchant. For example, on a per merchant basis, the supplyID module 104 may be configured to determine a sales value score basedon the ability of each merchant to supply a demanded offer. The supplyID module 104 may be configured to calculate a quality score, anexpected amount of bookings in units and/or dollars, a time to closeand/or a probability to close. Alternatively or additionally, the supplyID module 104 may calculate a return on investment value for one or moremerchants and/or offers. The supply ID module 104 may be configured tocalculate a merchant return rate, an offer value, and/or a merchantvalue. The supply ID module 104 may be configured to determine valuebased on each minute incremental minute of a salesperson's time and canbe configured to determine value based on the merchant quality score,the risk potential, the probability to close, and/or a time to close.Although supply ID module 104 is shown as being a single module includedin single promotional computing device, both the promotional computingdevice and/supply ID module 104 (like other devices and componentsdiscussed herein) can be embodied as a plurality of distributed systems,apparatuses, and/or any other suitable machine(s).

Further description related to current inventory is found in U.S.Provisional Patent Application No. 61/682,762, filed Aug. 13, 2012,titled “UNIFIED PAYMENT AND RETURN ON INVESTMENT SYSTEM”, and U.S.Provisional patent application Ser. No. 13/460,745, filed Apr. 30, 2012,titled “SALES ENHANCEMENT SYSTEM”, both of which is hereby incorporatedby reference.

Assignment module 106 may be configured to receive a prioritizedmerchant list and/or a salesperson list. Alternatively or additionally,the assignment module 106 can be configured to access a prioritizedmerchant data and/or salesperson data. Furthermore, the assignmentmodule 106 can be configured to identify capacity of one or moresalespersons, identify experience of one or more salespersons, and/oridentify expertise of one or more salespersons and assign merchant leadsbased on one or more of the aforementioned factors. Alternatively oradditionally, the assignment module 106 may be configured to generateand/or provide a prioritized call list for one or more salespersons. Theassignment module 106 may also be configured to receive updated merchantand/or inventory from, for example, the salespersons utilizing theprioritized call list and provide that information to the demand module102, the supply ID module 104, memory 304, and/or processor 302 or thelike.

FIGS. 4, 5, 7, 8, 10, 11, 12, and 13 illustrate example flowcharts ofthe example operations performed by a method, apparatus and computerprogram product in accordance with an embodiment of the presentinvention. It will be understood that each block of the flowcharts, andcombinations of blocks in the flowcharts, may be implemented by variousmeans, such as hardware, firmware, processor, circuitry and/or otherdevice associated with execution of software including one or morecomputer program instructions. For example, one or more of theprocedures described above may be embodied by computer programinstructions. In this regard, the computer program instructions whichembody the procedures described above may be stored by a memory 304 ofan apparatus employing an embodiment of the present invention andexecuted by a processor 302 in the apparatus. As will be appreciated,any such computer program instructions may be loaded onto a computer orother programmable apparatus (e.g., hardware) to produce a machine, suchthat the resulting computer or other programmable apparatus provides forimplementation of the functions specified in the flowchart block(s).These computer program instructions may also be stored in anon-transitory computer-readable storage memory that may direct acomputer or other programmable apparatus to function in a particularmanner, such that the instructions stored in the computer-readablestorage memory produce an article of manufacture, the execution of whichimplements the function specified in the flowchart block(s). Thecomputer program instructions may also be loaded onto a computer orother programmable apparatus to cause a series of operations to beperformed on the computer or other programmable apparatus to produce acomputer-implemented process such that the instructions which execute onthe computer or other programmable apparatus provide operations forimplementing the functions specified in the flowchart block(s). As such,the operations of FIGS. 4, 5, 7, 8, 10, 11, 12, and 13, when executed,convert a computer or processing circuitry into a particular machineconfigured to perform an example embodiment of the present invention.Accordingly, the operations of FIGS. 4, 5, 7, 8, 10, 11, 12, and 13define an algorithm for configuring a computer or processing to performan example embodiment. In some cases, a general purpose computer may beprovided with an instance of the processor which performs the algorithmsof FIGS. 4, 5, 7, 8, 10, 11, 12, and 13 to transform the general purposecomputer into a particular machine configured to perform an exampleembodiment.

Accordingly, blocks of the flowcharts support combinations of means forperforming the specified functions and combinations of operations forperforming the specified functions. It will also be understood that oneor more blocks of the flowcharts, and combinations of blocks in theflowcharts, can be implemented by special purpose hardware-basedcomputer systems which perform the specified functions, or combinationsof special purpose hardware and computer instructions.

In some embodiments, certain ones of the operations herein may bemodified or further amplified as described below. Moreover, in someembodiments additional optional operations may also be included. Itshould be appreciated that each of the modifications, optional additionsor amplifications below may be included with the operations above eitheralone or in combination with any others among the features describedherein.

Process for Sales Automation

FIG. 4 shows an example method, namely process 400, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2 a, 2 b, 2 c, and/or 3) to calculate aforecasted demand, identify new supply and prioritize and assign leads,in accordance with some embodiments discussed herein. As shown in block402 of FIG. 4, an apparatus, such as the promotional system 310, mayinclude means, such as the demand module 102, the processor 302, thecommunications interface 306 or the like, for receiving virtual offerdata. For example, a virtual offer may include a category and/or aservice sub-category, (e.g., massage as a category and/or shouldermassage as a sub-category. The offer may further include a locationand/or a hyper-local region (e.g., a location of Chicago, Ill. and/orhyper-local region of Wrigleyville). The virtual offer may furtherinclude a type of offer (e.g., two for one). A virtual offer, in thecontext of the aforementioned example, may be an offer that isconstructed, for example, by a computer algorithm, but may not beoffered for sale by a seller nor offered to a consumer.

As shown in block 404 of FIG. 4, the promotional system 310, may includemeans, such as the demand module 102, the processor 302 or the like forcalculating a forecasted demand. In general, a forecasted demand, whichmay be referred alternatively as a demand forecast or a projecteddemand, is calculated by calculating a probability that a particularuser would buy a particular offer in a particular time frame for atleast a portion of a plurality of users and for at least of a portion ofone or more virtual offers. An estimated number of units to be sold maythen be determined, or projected, for at least a portion of the one ormore virtual offers as a function of at least the probability associatedwith each of the one or more virtual offers. The probability may bebased on associated consumer data related to, for example, at least oneof a location, a gender, prior purchase history, personalizationsignals, seasonality or any combination thereof and by simulating aplurality of virtual offers in a plurality of hyper-local regions, usingfor example a virtual offer construction algorithm, and applying theassociated consumer data to the virtual offers. The output, forecasteddemand, may comprise at least one or more virtual offers and a demandedquantity of at least a portion of the one or more virtual offers.

As shown in block 406 of FIG. 4, the promotional system 310, may includemeans, such as the supply ID module 104, the processor 302, thecommunications interface or the like for receiving or otherwiseaccessing inventory data. As shown in block 408 of FIG. 4, thepromotional system 310 may include means, such as the supply ID module104, the processor 302 or the like for adjusting the forecasted demandand/or calculating an adjusted demand or residual demand. An adjusteddemand is the forecasted demand adjusted based on external factors(e.g., seasonality etc.). In some examples, a residual demand is theforecasted demand reduced by current inventory; such as the inventoryreceived at block 406.

As shown in block 410 of FIG. 4, the promotional system 310 may includemeans, such as the supply ID module 104, the processor 302 or the likefor identifying one or more merchants. The one or more merchants aredetermined as able to supply a portion of the adjusted demand. Ingeneral, the merchants may include any potential source of an offer. Forexample, the one or more merchants may include new merchants identifiedby, for example, a web crawler, or, alternatively or additionally, mayinclude merchants with whom, contracts have been previously closed. Insome examples, the list of merchants may come from a database ofmerchants that is maintained for the purposes of sales leads.

As shown in block 412 of FIG. 4, the promotional system 310 may includemeans, such as the supply ID module 104, the processor 302 or the likefor prioritizing the one or more merchants. Prioritizing may be may beaccomplished based on a calculated determination, such as a sales valuescore and/or the like. The sales value score may be calculated for theone or more merchants and may be a function of at least one of: expectedbookings, a merchant quality score, a probability to close, a time toclose, and a merchant return rate. In one embodiment, for providers whohave offered promotions in the past, prior performance data may also beutilized. For example, total bookings, number of activations, refunds,customer satisfaction, or the like may be used.

As shown in block 414 of FIG. 4, the promotional system 310 may includemeans, such as the assignment module 106, the processor 302, or the likefor assigning the prioritized supply to sales resources. In someexamples, the promotional system 310 may assign the one or moremerchants to one or more sales resources in accordance with at least thesales value score of the one or more merchants, a capacity of a salesresource, experience of a sales resource, expertise of a sales resourceor the like. As shown in block 416 of FIG. 4, the promotional system 310may include means, such as the assignment module 106, the processor 302,or the like for providing prioritized lists that may include each of oneor more merchants from the prioritized merchants that were assigned inblock 414. The sales resource may be responsible for converting one ormore sources of the prioritized merchants to inventory. The prioritizedlist may be configured in such a way as to provide a sales resource withone or more sources that may, for example, represent the highest earningpotential. The earning potential may be calculated for the salesresource, the merchants, and/or the promotional system 310.

In some example embodiments, the prioritized list comprises contactinformation and a suggested offer including a service, a quantity and aprice. The prioritized list may also provide contact reason whichprovide context to make the sales resource more effective. For example,the prioritized list may provide a sales resource with a suggestedproduct/service and desired supply, a price range, and/or hyper-localregion (e.g., 550+ units/month from $26-$50 for seafood in Middlesex).Alternatively or additionally, the prioritized list may comprise arating or a bounty. The rating or bounty may be related to a reward orcompensation system which may provide incentive for the sales resourceto close a specific merchant.

In some example embodiments, the prioritized list is generated based onsales resource related data, such that each prioritized list may beunique to a specific sales resource. The one or more merchants may beallocated to resources identified as best equipped to close them. Forexample, important sources may be divided equally in order to ensureeach source is given priority by the assigned resource. In some exampleembodiments, particular sources may be allocated based on a relationshipstatus with a specific resource. In some example embodiments, sourcesmay be allocated based on an expertise of a resource. For example, aspecific sales representative may be identified as having a higher closerate for health and beauty as compared to other sales representatives.In some example embodiments, sources may be allocated based on capacityof the resource.

Further discussion related calculating a demand forecast, identifyingnew supply, and prioritizing and assigning leads can be found in U.S.Provisional Patent Application No. 61/730,046, titled “METHOD ANDAPPARATUS FOR MATCHING SUBSCRIBER DEMAND WITH MERCHANT/INVENTORY SUPPLY”filed on Nov. 26, 2012”, U.S. Provisional Patent Application No.61/682,762, filed Aug. 13, 2012, titled “UNIFIED PAYMENT AND RETURN ONINVESTMENT SYSTEM”, and U.S. Provisional patent application Ser. No.13/460,745, filed Apr. 30, 2012, titled “SALES ENHANCEMENT SYSTEM”, eachof which is hereby incorporated by reference.

Process for Forecasting Demand

FIG. 5 shows an example method, namely process 500, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2 a, and/or 3) to calculate a forecasteddemand, in accordance with some embodiments discussed herein. As shownin block 502 of FIG. 5, an apparatus, such as the promotional system310, may include means, such as the demand module 102, the processor302, the communications interface 306 or the like, for receiving virtualoffer data and consumer data.

In some example embodiments, consumer data is stored in memory, such asmemory 304, and the consumer data is accessed from memory (e.g., a localmemory, a remote memory or the like) by, for example, a demand module102 or processor 302. Consumer data may include, for example, age,gender, location, hyper-local region, and/or past purchase historyincluding specific offers, dates, cost expenditures, offer types, offerstructures, etc. Consumer data may be the accumulation of informationrelated to each of or some portion of a current subscriber database. Inanother embodiment consumer data may comprise income information. In oneembodiment, wherein income information may not be available, consumerdata may comprise predicted income information. Predicted incomeinformation may be a function of one or more of an age, gender,location, hyper-local region, and past purchase history.

As shown in block 504 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for calculating a probability that a consumerwould buy a virtual offer. In some examples, the consumer data may beused as an input signal to a virtual offer generation system that isconfigured to use the consumer data to model the likelihood that aconsumer would buy a particular virtual offer. For example, based oninformation such as demographic, area, historical stats, gender, incomeand/or the like, the model may output a probability that one or moreconsumer would purchase a particular virtual offer. In one embodiment,characteristics (e.g., mean or median income) of an area, demographic,or gender associated with a consumer may factor into the calculation ofthe probability that a consumer would buy a virtual offer. For example,if a consumer is associated with an area with a mean income of apredetermined threshold (e.g., $150,000), increased probabilities may becalculated for particular virtual offers related to particularcategories, sub-categories, or prices.

As shown in block 506 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for generating a ranked list for eachconsumer comprising each of one or more virtual offers and associatedprobability that the consumer would purchase the virtual offer. In someexamples and by using an example pivot table or the like, the list ofconsumers and their associated probabilities for each of the virtualoffers may be converted into a listing of virtual offers and relatedprobabilities for each consumer.

In one embodiment, a demand calculation engine 114 may be utilized forcalculating the probability a consumer would buy a virtual offer, asshown in block 504, and generating a ranked list as shown in step 506.FIG. 10 shows an exemplary process for generating a ranked list ofvirtual offers.

Further discussion may be found in U.S. patent application Ser. No.13/411,502, filed Mar. 2, 2012, titled “RELEVANCE SYSTEM FOR CONSUMERDEALS”, and U.S. Provisional Patent Application No. 61/730,046, titled“METHOD AND APPARATUS FOR MATCHING SUBSCRIBER DEMAND WITHMERCHANT/INVENTORY SUPPLY” filed on Nov. 26, 2012”, each of which isincorporated by reference in its entirety.

As shown in block 508 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for assigning voting values to one or morevirtual offers on one or more of the ranked lists generated in block506. In some example embodiments, a first voting value is assigned to apredetermined number of virtual offers. For example, a voting value of 1may be assigned to each of the top 5 virtual offers on each consumer'sranked list. In some example embodiments, a first voting value isassigned to a first virtual offer and a second voting value is assignedto a second virtual offer, e.g., a voting value of 1 is assigned to thevirtual offer with the highest probability and a voting value of 0.8 isassigned to the next highest. Alternatively or additionally, descendingvoting values may be assigned to each of a predetermined number ofvirtual offers, e.g., a voting value of 1 is assigned to the highest, avoting value of 0.8 to the second highest, a voting value of 0.6 to thethird highest, etc. In some example embodiments, assignment of votingvalues may be limited to a predetermined amount of any one of acategory, sub-category, location, hyper-local region or price range. Forexample, a voting value may only be assigned to a predetermined number(e.g., 2 virtual offers in “food and dining”).

As shown in block 510 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the processor 302, thecommunications interface 306 or the like, for aggregating the rankedlists for each consumer into a single list using the voting values. Forexample, the voting values that a first virtual offer received for eachconsumer are summed and the virtual offer is added to the single listwith summed number.

As shown in block 512 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for calculating projected sales data. In someexamples, the projected sales volume, revenue, profit, or the like maybe calculated based on a calculation of how many or much of a virtualoffer will be sold to a subscriber base. In some examples, and as shownin block 514 of FIG. 5, an apparatus, such as the promotional system310, may be configured to rank the virtual offers by sales projectedsales data. In one example embodiment, projected sales data may becalculated for each of one or more virtual offers on the single list,based on the summed voting values. For example, virtual offers appearingon a plurality of user lists are going to have a plurality of votingvalues that will be summed. The summed total of voting values then mayappear on the single list and the summed total may then be used tocalculate one or more of a projected sales volume, revenue, profit orthe like.

As shown in block 514 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for selecting virtual offers for inclusion ina forecasted demand according to the ranking and/or a predeterminedportfolio mix. As shown in block 516 of FIG. 5, an apparatus, such asthe promotional system 310, may include means, such as the demand module102, the processor 302 or the like, for accessing external factor dataand/or inventory data. For example, inventory data may includeinformation related to current and/or available inventory. Currentand/or available inventory may include information related to closedcontracts, unprocessed offers, unsold inventory, and/or recurringinventory.

In some example embodiments, available inventory data may also includepotential offers related to merchants that are not currently undercontract, but there is a high probability that they could be undercontract based on a calculated probability to close. Probability toclose represents a probability of a merchant committing their inventory,such as signing a contract and maybe generated based on a regressionthat takes into account, but not limited to, a lead source, such as forexample a “warm lead” versus a “cold call”, quality of the lead source,merchant attributes, stage of close, interface time, talk time, pastfeature history data, past feature performance(s), high priorsatisfaction, an upcoming expiration of an offer, whether the merchantis a new or existing customer, and/or whether the merchant has adoptedother services. For example, a representative may have a higherprobability to close if the offer in question is the same or similar toa past offer offered by the merchant. In the aforementioned instance,the probability to close may be above a threshold and the offer may beincluded in the available inventory.

Further description related to current inventory is found in U.S. Ser.No. 13/460,745, filed Apr. 30, 2012, and titled “SALES ENHANCEMENTSYSTEM”, which is hereby incorporated by reference. Further descriptionrelated to recurring inventory is found in U.S. Ser. No. 61/639,067,filed Apr. 26, 2012 titled “DEAL METER”, which is hereby incorporated byreference.

External factor data may include similar data that may be used ingenerating a forecasted demand, including for example, past offerperformance data, internal signal data, and/or external signal data.Past offer performance data may include, but is not limited to, specificcategories and/or sub-category performance within a location and/orhyper-local region, as well as specific offer structure, offer type,and/or price range performance in one or more categories,sub-categories, locations, and/or hyper-local regions. Internal signalsmay include consumer, subscriber, and/or merchant feedback, such assurveys, velocity data related to specific transactions, consumer searchdata, and consumer click through data and/or the like. External signalsmay include third party search engine consumer search data, third partyclick through data, market data, consumer data, and/or merchanttransaction data. Market data may include predicted market conditions orthe like. Examples of predicted market condition information for a givenmarket may include predicted population growth, predicted income growth,predicted inflation and predicted promotion system growth in a givenlocation. The predicted market data may factor in demographic dataand/or socio-economic data.

As shown in block 520 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for calculating an adjusted forecasteddemand. In some examples, one or more adjustments based on offerdiversity, portfolio mix, price mix, hyper-local constraints, priorperformance, context information or the like may be made to theforecasted demand. For example, in an instance in which market data mayindicate income growth, aging population, or the like in a location orhyper-local region, forecasted demand for particular virtual offersassociated with corresponding income growth, aging or the like may beadjusted accordingly.

Further discussion related calculating offer diversity can be found inU.S. Ser. No. 61/709,623, filed Oct. 4, 2012, titled “MERCHANT SIDECROSS-CATEGORY DEAL DIVERSITY”, which is hereby incorporated byreference.

As shown in block 522 of FIG. 5, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for outputting a forecasted demand. In someexample embodiments, outputting of the adjusted forecasted demand mayinclude exporting the adjusted projected sales data to a spreadsheetdocument for display and organizing, storing the adjusted projectedsales data to a memory for archiving and/or sending the adjustedprojected sales data to a processor of the like for further use. Itshould be noted that even though the term “adjusted” is used, theforecasted demand may be equal to the adjusted forecasted demand and theprojected sales data may be equal to the adjusted projected sales dataif, for example, units of a specific offer are not available.

Process for Supply Identification

FIG. 7 shows an example method, namely process 700, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2, and/or 3) to identifying merchants, inaccordance with some embodiments discussed herein. As shown in block 702of FIG. 7, an apparatus, such as the promotional system 310, may includemeans, such as the supply ID module 104, the processor 302, thecommunications interface 306 or the like, for receiving a forecasteddemand.

As shown in block 704 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302, the communications interface 306 or the like foraccessing current offer inventory. As shown in block 706 of FIG. 7, anapparatus, such as the promotional system 310, may include means, suchas the supply ID module 104, the processor 302, or the like forcalculating a residual forecasted demand. In some example embodiments,the residual demand calculation module 224 may be configured to receivea forecasted demand that is input via the demand input module 220 andcalculate a residual demand by subtracting existing inventory from theforecasted demand. In one embodiment, existing inventory may be at leastone of inventory related to offers closed within a predetermined timeperiod (e.g., one day prior), offers closed within a secondpredetermined time period (e.g., one month), existing offer inventoryadjusted for quality, which is described below, and recurring inventory.In some example embodiments, only those offers in inventory matchingeach of the category, sub-category, location, and price or price rangemay be subtracted from the demand. Alternatively or additionally,predetermined substitutions may be made (e.g., where one or more ofcategory, sub-category, location, hyper-local region, and price rangemay be different) and the predetermined substitutions may specifyspecific allowable substitution for particular categories,sub-categories, locations, hyper-local regions, and/or price ranges. Insome examples, similar categories or sub-categories or any other facetof the virtual offer may also reduce demand.

In some example embodiments, specific guidelines may be utilized indetermining which particular offers in a current inventory may beconsidered. In some example embodiments, when determining residualdemand, only those offers in current inventory that are available for anentire time frame the forecasted demand was calculated for may beconsidered. For example, in an instance in which a first virtual offercomprises a first demand and the first demand was calculated forspecific time frame, such as for example one month, only those offers incurrent inventory available for the entire specific time period, e.g.,one month, are considered in calculating a residual demand.Alternatively or additionally, when an offer is in current inventory, adetermination may be made to calculate how many units of the offer arelikely to be sold, using for example prior purchase history, otherhistoric data, current offers and/or the like, and only that numbercalculated may be utilized when calculating residual demand. Forexample, if 200 units of an offer featuring “personal training sessions”in a local area are available in local inventory, but based on priorpurchase history, only 100 are determined as likely to sell, residualdemand may be calculated using the 100 units likely to sell instead ofthe 200 units in the current inventory.

In one embodiment, a dynamic deal optimization (DDO) score may becalculated. In order to facilitate calculation of a DDO score, theapparatus may be configured to access data related to a limitedperformance of an offer. The limited performance may be comprised ofperformance related to a limited sub-set of consumers. The limitedsub-set of consumers may be for example 30,000 out of 1,000,000. Thelimited sub-set of consumers may be distributed in a predeterminedfashion among consumers based on age, gender, location, hyper-localregion, or the like. the apparatus may then be configured to access,calculate, and/or determine a conversion rate among a cross section ofthe limited sub-set of consumers. For example, a conversion rate may becalculated for females. Additionally or alternatively, a conversion ratemay be calculated for one or more cross sections, such as for example,males between 22-30 years of age. Based on the conversion rate, thepromotions may be offered to more of particular consumers. The apparatusmay further be configured to calculate a portion of existing inventorythat may be applied to demand in order to calculate residual demandbased on a conversion rate. In one embodiment, the apparatus isconfigured to calculate a projected amount of the existing inventorythat may sell based on the conversion rate and utilize the projectedamount in a residual demand calculation.

In some example embodiments, penalties may be applied to offers incurrent inventory based on a time frame that they have been available orsitting in inventory. Penalties may also be applied based on priorexposure or seasonality also. For example, 400 units of offer for“American Food” with a sub-category “Burgers” may be in currentinventory. The 400 units may be utilized in calculating residual demand,or the 400 units may be discounted based on the time spent in inventory(e.g., 20% per 3 months), prior exposure (e.g., 20% discount for eachmonth it's been featured), and/or seasonality (20% discount in thesummer). After applying the penalties, less than the 400 available unitsmay be considered when calculating residual demand.

In one embodiment,

Alternatively or additionally, in some example embodiments, beforecalculating a residual demand based on current inventory, the merchantsin the current inventory are provided to the sales value scorecalculation module 228. In an instance in which a sales value score fora merchant satisfies a predetermined threshold or ranking, then theinventory provided by that merchant would be considered in calculatingresidual demand. In another example embodiment, in an instance in whicha sales value score for a merchant does not meet a predeterminedthreshold or ranking, the inventory provided by that merchant would notbe considered in calculating residual demand.

As shown in block 708 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302, the communications interface 306 or the like foraccessing a merchant database. As shown in block 710 of FIG. 7, anapparatus, such as the promotional system 310, may include means, suchas the supply ID module 104, the processor 302, or the like foridentifying merchants to fill the residual demand. In an instance inwhich the merchant is able to provide good, services and/or experiencesas defined by the merchant demand, the merchant may be identified asable to fill the residual demand. In some examples, the one or moremerchants may be determined based on a global listing of merchantsstored in a merchant database. As such, to the extent the merchantprovides a good, service or experience that matches or is related to ademanded offer, the demanded offer may be assigned or otherwise linkedto that merchant. Each merchant may therefore be assigned zero or moredemanded offers as defined by the residual demand.

In one embodiment, an apparatus, such as the promotional system 310, maybe configured to identify new and/or additional goods, services, and/orexperiences a merchant may provide. The apparatus may be configured, forexample, to identify a merchant website, a review web-site, and/or agood, service or experience specific website, and determine, from datafound on the website, one or more new or additional good, services,and/or experiences a merchant may provide. For example, a hotel may beidentified to be able to fill a portion of demand related to “travel andtourism” or the like. The apparatus may then identify websites thatidentify the hotel as a subject, such as for example the hotel'swebsite, a review website, a review website related to travel, tourismor hotels, or the like. The apparatus may then identify information onthe website related to other services, goods, or experiences the hotelmay be able to provide. For example, the hotel's website may provideinformation for breakfast, dinner and/or drinks or a review website mayinclude a review about a spa service offered by the hotel. In oneembodiment, additional virtual offers may be associated with a merchantwhere new or additional goods, services, and/or experiences areidentified. In another embodiment, information relating new oradditional goods, services, and/or experiences identified as able to beprovided by a particular merchant may be stored in the merchantdatabase.

As shown in block 712 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for calculating a sales value score for one ormore merchants. The sales value score may be a function of one or moreof a merchant quality score, a merchant value score, a risk potential, aprobability to close and a time to close, each discussed in more detailbelow. In some example embodiments, a sales value score may becalculated using a research ranking, current stage in the sales funnel,the source of the merchant, category information, location information,what, if any, historical relationship each merchant has with thepromotional system 310, or any combination thereof. In one embodiment,for providers who have offered promotions in the past, prior performancedata may also be utilized. For example, total bookings, number ofactivations, refunds, customer satisfaction, or the like may be used.

In some example embodiments, one or more of a merchant value, a merchantquality score, a risk potential, a probability to close and a time toclose are used to calculate a prioritization score. The prioritizationscore is then used, along with demand information, such as a number ofunits of a virtual offer and expected revenue to compute the sales valuescore.

As shown in block 714 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for calculating a merchant value. The merchantvalue may be calculated by estimating a value of a next offer themerchant may offer, a chance of working with the merchant (e.g.,probability of closing), a value of future offers with the merchant(e.g., all offers in next month, 6 month, year or the like), the chanceof closing one or more of the future offers, a merchant goodwill score,a relationship cost, and an ongoing value. The merchant goodwill scoremay represent a “wow” factor and may be calculated as a function ofconsumer's reaction to offering a service. This factor may be measuredby, for example, likes, reviews above a predetermined threshold on anyone or more of review websites. The merchant goodwill score,alternatively or additionally may represent a value of futurerecommendation from the merchant, which may be generated through forexample, word of mouth, direct relationships, and/or via leveraging therelationship to approach and/or close other merchants. One exampleformula that may be utilized in calculating a merchant value may beMerchant Value=(probability of closing merchant)*(Value of nextoffer)+(probability of closing subsequent offers)*(Value of subsequentoffers)+mechant_goodwill+ongoing_value−relationship_cost

As mentioned above, merchant value may be a function of an offer value.In some example embodiments, offer value may indicate or be a functionof one or more of profit, discounts used, number of activated consumers,number of re-activated consumers, refunds, engagement value, netgoodwill.

The engagement value may be a value that can be associated to users who(1) click on an offer from a particular merchant, (2) visit an offerpage and don't purchase, (3) search for the offer, (3) tell theirfriends about the promotion system, (5) “like” the offer on socialmedia. Net goodwill may be indicative of (1) good experiences and/or (2)bad experiences. One example formula that may be utilized in calculatingan offer value is:Offer Value=profit−discounts+# activations*activation value+# ofreactivations*reactivation value−refunds+engagement_value+net_goodwill

In one example embodiment, offer value may be relative to a quantitysold, units sold to new consumers, units refunded and/or the like.

As shown in block 716 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for calculating a merchant quality score. Insome example embodiments the merchant quality score is generated basedon a predicted value of how well (e.g. revenue, new business, etc.) amerchant will do on an offer and the customer reaction (e.g. based onhistorical data, similar results, demand etc.) to the particular offer.FIG. 11 shows an example method that may be used to calculate a merchantquality score.

As shown in block 718 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for calculating a risk potential. Riskpotential may be calculated based on a merchant return rate. Forexample, if a merchant return rate is 10%, the risk potential may becalculated to be greater than a merchant with a return rate of 2%.

As shown in block 720 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for calculating a probability to close. Insome example embodiments, probability to close may be calculated as afunction of (1) stage in sales pipeline, e.g., not wanted, unknown,uncontacted, contacted, negotiating, contract sent, closed; (2) sourceof merchant, e.g., cold call, web to lead, other; (3) history e.g., rana promotion, ran a feature using a different promotional system, has notrun; (4) category; (5) sub-category; or some combination thereof.Probability to close may be calculated based on a particular time window(i.e. 30 days or 60 days). In some example embodiments, probability toclose may be calculated using a mathematical tool, such as a logisticalregression model.

As shown in block 722 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for calculating a time to close. In someexample embodiments, time to close may be a function of (1) the averagetime to close for each of a plurality of stages of a sales pipeline; (2)stage in sales pipeline, e.g., not wanted, unknown, un-contacted,contacted, negotiating, contract sent, closed; (3) source of merchant,e.g., cold call, web to lead, other; (4) history e.g., ran a promotion,ran a feature using a different promotional system, has not run; (5)category; (6) sub-category; or some combination thereof. Alternativelyor additionally, time to close may be calculated under the assumptionthat the merchant will be closed. In some example embodiments, time toclose may be calculated using a mathematical tool, such as a logisticalregression model.

Alternatively or additionally, business rules may be configured tooverride or otherwise adjust a merchant score. Business rules include,but are not limited to, does the merchant have an expiring offer (e.g.call regarding a re-feature), any contact from the merchant, did themerchant recently start an offer, is the merchant running offers in themarket, is the merchant on a targeted list, is the merchant a formermerchant, is the merchant on another list that is indicative of apositive or negative and/or the like. In some cases the business rulesmay be set based on a desire to attract new business, attract newconsumers, increase margin, increase portfolio diversity and/or thelike.

As shown in block 724 of FIG. 7, an apparatus, such as the promotionalsystem 310, may include means, such as the supply ID module 104, theprocessor 302 or the like for prioritizing merchants. In some exampleembodiments, the one or more merchants may be prioritized by salesvalues score. As shown in block 726 of FIG. 7, an apparatus, such as thepromotional system 310, may include means, such as the supply ID module104, the processor 302 or the like for outputting a list of prioritizedmerchants. In some example embodiments, the supply ID module 104transmits prioritization data to the assignment module 106.Alternatively or additionally, outputting of the merchant prioritizationinformation may include exporting the data to a spreadsheet document fordisplay and organizing, storing the data to a memory for archivingand/or sending the data to a processor of the like for further use.

Process for Lead Assignment

FIG. 8 shows an example method, namely process 800, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2, and/or 3) to assign leads, in accordancewith some embodiments discussed herein. In some example embodiments,leads are programmatically assigned so as to eliminate subjectivity andfavoritism from the allocation process, reduce attrition, maintainestablished relationships between resources and merchants they have madecontact with, properly plan for the capacity of each resource tomaximize sales value, provide leads to resource best suited to closethem (e.g., using specialization and capacity), continually grow eachresource book of business and/or the like. In some example embodiments,sales resources may be provided a target that may be based on the % ofthat division's assets (accounts) that they own and a target for newleads. In another example embodiment, sales resources may be provided atarget that may be based on the number of bounties to be collected byacquiring inventory from one or more marked. As such, a basic portfoliofor a rep may include a number of merchants, based on an average of repsthat a particular resource may handle, a set of new merchants, aportfolio mix of different categories, sub-categories or the like. Insome examples, a new resource may be issued a set new resource basket.

As shown in block 802 of FIG. 8, an apparatus, such as the promotionalsystem 310, may include means, such as the assignment module 106, theprocessor 302, the communications interface 306 or the like forreceiving prioritized merchant data. In some example embodiments, thelead assignment process 800 may receive one or more leads.

As shown in block 804 of FIG. 8, an apparatus, such as the promotionalsystem 310, may include means, such as the assignment module 106, theprocessor 302, the communications interface 306 or the like forreceiving sales resource data. For example, process 800 may receiveinformation related to salespersons responsible for closing contractswith merchants that offer services that fulfill at least a portion ofthe forecasted demand.

As shown in block 808 of FIG. 8 an apparatus, such as the promotionalsystem 310, may include means, such as the assignment module 106, theprocessor 302 or the like for identifying capacity. In one embodiment,in order to facilitate the capacity calculation, the average number ofunique providers contacted per “normal” day over a period of, forexample two weeks, may be calculated and outliers may be excluded. TheLead Assignment module may place the highest value leads as high on asales rep's list as possible relative to the number of unique merchantcontacts they make, thus minimizing time to contact for the highestvalue leads. In some example embodiments, the promotional system 310 isconfigured to identify or access data indicating a capacity of one ormore sales resources. In one embodiment, the promotional system 310 maybe configured to track and/or store information related to each contacta sales resources makes or attempts to make (e.g., a phone call oremail). The promotional system 310 may also be configured to calculatesales resource activity data. For example, the promotional system 310may calculate a number of providers contacted per time period (e.g., 8hours, day week or the like). The promotional system 310 may also beconfigured to calculate, store, or track a moving average (e.g., a 10day moving average) of number of providers contacted per predeterminedtime period. Additionally or alternatively, each of one or more salesresources may have a target number of providers to contact perpredetermined time period that may be based on the type of salesresource (e.g., a sales representative, an email marketing system or thelike). The promotional system 310 may be configured to calculate, store,or track a number of providers contacted, a number of providerscontacted per predetermined time period, a percentage of a target numberof providers contacted per predetermined time and/or any of thepreceding in a moving average format. In one embodiment, outlying datamay be identified and adjusted for.

Alternatively or additionally, as shown in block 810 of FIG. 8 anapparatus, such as the promotional system 310, may include means, suchas the assignment module 106, the processor 302 or the like foridentifying experience of one or more sales resources. Alternatively oradditionally, experience may be provided with respect to particularcategories, sub-categories, locations, and/or hyper-local regions withinwhich a sales resource has experience. Alternatively or additionally,experience may be indicated by a time measurement and/or a number ofleads closed.

As shown in block 812 of FIG. 8, an apparatus, such as the promotionalsystem 310, may include means, such as the assignment module 106, theprocessor 302 or the like for identifying expertise. In some exampleembodiments, the promotional system 310 is configured to identify oraccess data indicating an expertise or an expertise score of one or moresales resources. Alternatively or additionally, experience may indicatecategories, sub-categories, locations, and/or hyper-local regions withinwhich a sales resource has expertise.

As shown in block 814 of FIG. 8, an apparatus, such as the promotionalsystem 310, may include means, such as the assignment module 106, theprocessor 302 or the like for calculating an assignment probabilitynumber. In some example embodiments, an assignment probability numberrepresents a probability that a sales resource will be randomly assignedto a next merchant in an assignment process. The assignment probabilitynumber may be calculated or assigned based on at least one of theassociated capacity, the associated experience, the associatedexpertise, the associated merchant mix of a sales resource, or anycombination thereof.

As shown in block 816 of FIG. 8, an apparatus, such as the promotionalsystem 310, may include means, such as the assignment module 106, theprocessor 302 or the like for assigning merchant leads. In someexamples, the process for assigning a merchant to a resource may includea weighted random allocation, in some examples, a weighted randomallocation gives every resource a probability for receiving the newlead. In some example embodiments, assignment may be weighted based on alikelihood that a merchant will be contacted based on a daily capacityfor a representative. For example, a merchant may be less likely to beadded as 120^(th) on a list for a resource that averages 100 contactsper day. In further example embodiments, merchants may not be allocatedto a resource, if that merchant was de-allocated from that resource dueto inactivity. In some examples, a resource has a greater chance ofreceiving a merchant in an assignment list if the ordinal rank themerchant would fall within their call list within a specific timeperiod. In other examples, the resource may be more likely to receive amerchant if they have fewer leads or have a deficit related to aportfolio mix. In some examples, the leads may be assigned to new repsif they are easier to close so as to reduce attrition. In other examplesspecialization or strength of existing relationship could cause acertain lead to be assigned to a specific resource. In some examplesoutside resources may also be used.

In one embodiment, supply sources are considered one at a time andassignment probability numbers are determined for each of one or moresales resources before making an assignment. FIG. 12 shows an examplemethod for calculating and/or determining an assignment probabilitynumber for each of one or more sales resources. In one embodiment, salesresources are considered for each of one or more supply sources and anassignment probability number is calculated before each assignment. Inanother embodiment, assignment probability numbers are re-calculatedonce per specific time period, e.g., once per day. In one embodiment,once the assignment probabilities are calculated, each of one or moresupply sources are assigned based on the calculated assignmentprobability numbers.

In some example embodiments, merchants may be de-allocated and/orre-assigned according to predetermined metrics. For example, a merchantmay be re-assigned (1) if a sales resource has made no contact and/orhas no activity with a merchant for a predetermined period of time, thepredetermined period of time may be based on merchant information suchas lead source; (2) if a sales resource has made no contact and/or madeno activity within a predetermined period of time from a previousactivity; and (3) if a sales resource has no traction activity (e.g., 5minutes of contact) within a predetermined period of time. A merchantmay also be reassigned if a sales resource has not closed a contractwithin a predetermined period of time, the predetermined period of timebased on a merchant ranking. A merchant may also be reassigned if asales resource has closed a first contract, but has not closed a secondcontract within a predetermined period of time from expiration, thepredetermined period of time based on a merchant ranking. FIG. 13 showsan example method that may be executed to determine whether and when tode-allocate a supply source from a sales resource.

When re-assigning merchants, as opposed to assigning a new merchant to asales resource, predetermined rules may be used. For example, if amerchant is de-allocated from a first sales resource, duringre-allocation, the merchant may not be re-assigned to the first salesresource. In some example embodiments, a merchant may be re-assignedbased on a position on a potential sales resource's prioritized list.For example, a merchant that would be second on a first sales resource'sprioritized list may have a greater chance of being assigned to thefirst sales resource than a second sales resource where the merchant maybe third or lower in priority. In one embodiment, when a provider isde-allocated, previous contact history information associated with theprovider is stored and/or tracked and may be utilized in there-allocation process. For example, in an instance in which a providerhas responded poorly to sales resource contact attempts, an associatedprobability to close may be adjusted downward. In an instance in which aprovider has responded poorly to a number of resource contact attempts,a method of contact and/or a type of sales resource may be adjusted(e.g., changing from sales representatives to email marketing team orchanging from calling by phone to emailing). In one embodiment, in aninstance in which a provider has responded poorly to a number of salesresource contact attempts, an associated probability to close may beaffected to a point where the sales value calculation is lowered and theprovider is not re-assigned. In another embodiment, in an instance wherea provider has responded favorably to sales resource contact attempts,an associated probability to close may be increased. In one embodiment,the increase in probability to close may result in the provider beingre-assigned to a different sales resource type or contact method (e.g.,email to phone).

In one embodiment, prior activity information related to a provider maybe utilized to determine if several sales resources have tried andfailed to close them. In those cases, the provider may be moved to forexample, a sales resource comprised of a team of experts who specializein new approaches, or to an outside rep who can make an in person visit.The determination may be made based on a number of sales resources, forexample sales representatives that have made unsuccessful calls.Additionally or alternatively, the provider may be not allocated for apredetermined time (e.g., “rested”) and revived at a later point in timein case there is a change in management or circumstance.

As shown in block 818 of FIG. 8, an apparatus, such as the promotionalsystem 310, may be configured to generate one or more prioritized data,such as call lists, for each of one or more sales resources. Forexample, the prioritized data may include a prioritized call list uniqueto each individual representative. As shown in block 820 of FIG. 8, anapparatus, such as the promotional system 310, may be configured toprovide the prioritized call list to one or more sales resources.

As shown in block 820 of FIG. 8, an apparatus, such as the promotionalsystem 310, may be configured to receive merchant information updatesand/or inventory information updates. For example, the assignment module106 may receive information related to a call being placed, a contractbeing closed, a merchant declining participation, etc.

As shown in block 824 of FIG. 8, an apparatus, such as the promotionalsystem 310, may be configured to provide updated merchant informationand/or updated inventory information. For example, the assignment module106 may provide updated inventory information, such as for example aclosed contract, to the demand module 102, which then may be used toupdate available inventory and thus, update the forecasted demand. Insome example embodiments, promotional system 310 may be updateddynamically each time a contract is closed. Alternatively, thepromotional system 310 updates daily. An updating process may includeupdating a current inventory list and merchant database, re-calculatinga forecasted demand, re-adjusting a forecasted demand, re-calculatingmerchant score data, re-prioritizing merchants, updating sales resourceinformation regarding capacity, expertise and/or experience,re-assigning leads, and/or regenerating prioritized calls lists.

Commissions

In some examples, the assignment module 106 may also provide a point oraward structure to resources based a give point value to a merchantbased on a merchant value (e.g., sales value score) and a difficulty toclose (e.g. probability to close). Using the point values, resources maybe provided with a tiered commission rate based on the point valuethresholds. As such, the commission rewards can be viewed as amotivation or otherwise instant reward for closing an offer.

In some examples, the bounty or points may be assigned based on currentneeds and may be configured to dynamically change based on currentpriorities, inventories, mix and/or the like. In other cases, lowervalue merchants may rise based on changes in status, positive reviews orthe like. Alternatively or additionally, the point values may remainstatic when with a particular merchant, but may change if the merchantis reassigned.

In some example embodiments, the point value is assigned based oncurrently expected bookings (e.g., current demand*price point),intrinsic merchant value, intrinsic probability to close, productivityand/or the like. For example, the merchant value may be multiplied by1/probability to close and scaled using an exponential decay curve. Sucha curve is chosen because if a merchant as 50% probability to close,then it will take the resource 2 merchants to close. As such, thatmerchant may have a lower point value when compared to a merchant with a10% probability to close where it would take 10 merchants before thatresources can close a single offer. In some example embodiments, pointvalues assigned to a provider may be modified by the actual offer (e.g.,offer structure) that is closed with a provider. For example, lessefficient offer structures reduce the point values a sales resource maycapture.

In some examples, based on the programmatically determined point values,commission rates may be assigned based on the percentage of points totarget earned for a period. In some cases, the target may be changedbased on amount of time in the system, previous month's performanceand/or the like. In some example embodiments, additional points may beassigned based on closing of particular merchants, new merchants, highmargin merchants and/or the like.

Sales Automation Pipeline Example

FIG. 6A shows an exemplary embodiment of the aggregation of a forecasteddemand. As can be seen, a forecasted demand may be shown on a colorcoded map. Here, a forecasted demand for sushi in Chicago is shown.Hyper-local regions with higher levels of demand are shown in a darkercolor (e.g., red) while hyper-local regions with lower demand are shownin a lighter color (e.g., yellow). Demands of varying degrees are shownin color in between.

FIG. 6B shows an exemplary embodiment of the adjusted aggregation of aforecasted demand. As can be seen, an adjusted forecasted demand may beshown on a color coded map. Continuing from the example related to FIG.6A above, FIG. 6B shows an adjusted forecasted demand for sushi inChicago. Specifically, a forecasted demand map is shown after beingadjusted to account for the existing units of sushi in inventory. Theinventory or sushi may include sushi from merchants who have signedcontracts for offers but have not yet offered an offer, offers that areopen and have not yet expired and/or recurring offers that may beoffered again. Hyper-local regions with higher levels of unmet demandmay be shown in a darker color (e.g., red) while hyper-local regionswith lower unmet demand may be shown in a lighter color (e.g., yellow).Unmet demand of varying degrees may be shown in colors in between.

FIG. 6C shows an exemplary embodiment of block 710. As can be seen,merchants offering sushi in Chicago are identified. In some exampleembodiments, the information is shown overlaid onto the adjustedforecasted demand map. In some example embodiments, all merchants in alocation are identified and added to a database with the products and/orservices that the merchant offers. That database is then searched forthe merchants that offer a specific product, in the example above,sushi.

FIG. 6D shows an exemplary embodiment. Here, the identified merchantsare ranked. In some example embodiments, the merchants are ranked usingthe adjusted forecasted demand, merchant value, merchant quality score,risk potential, probability to close, time to close and/or the like.

FIG. 9 shows an exemplary embodiment of a prioritized call list. In someexample embodiments of the present invention, the prioritized call listutilizes the adjusted demand, the supply, the probability to close, andthe merchant quality score. The prioritized call list may also provideany needed contact information including names, numbers, hours. Theprioritized call list may further include one or more contact reasonswhich provide context to make the representative more effective. Theprioritized call list may further provide a representative with amerchant rating, a required or suggested product/service and desiredsupply, a price range, and/or hyper-local region (e.g., 550+ units/monthfrom $26-$50 for seafood in Middlesex).

Calculating a Probability that a Particular Consumer would Buy aParticular Virtual Offer and Ranking Virtual Offers

FIG. 10 shows an example method, namely process 1000, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to calculate a probabilitythat a consumer may buy a particular virtual offer and generate a rankedlist of virtual offers, in accordance with some embodiments discussedherein. As shown in block 1002 of FIG. 10, an apparatus, such as thepromotional system 310, may be include means, such as the demand module102, the processor 302, the communications interface 306 or the like,for accessing or receiving virtual offer data and consumer data.

As shown in block 1004 of FIG. 10, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for extracting features from one or both ofone or more virtual offers and consumer data.

In some example embodiments, consumer data is stored in memory, such asmemory 304, and the consumer data is accessed from memory (e.g., a localmemory, a remote memory or the like) by, for example, a demand module102 or processor 302. Consumer data may include, for example, age,gender, location, hyper-local region, and/or past purchase historyincluding specific offers, dates, cost expenditures, offer types, offerstructures, tenure, email domain information, etc. Consumer data may bethe accumulation of information related to each of or some portion of acurrent subscriber database. For example, tenure is an indication of thelength of time a user has been a subscriber. In another example, basedon the domain of the email address (such as Gmail®, Hotmail®, AOL®,etc.), the demand module 102, processor 302 or the like may infercertain characteristics. For example, a AOL® user tends to be olderwhereas a Gmail® user tends to be younger.

In one embodiment, block 1004 may extract the distance between aconsumer and a virtual offer and a consumer's prior purchases in acategory. As another example, block 1004 may extract the age, gender ofa consumer, extract the category of the multiple virtual offers, andcalculate the distance between the consumer and the multiple virtualoffers. The features extracted may be input to the scoring/rankingalgorithm, which outputs a list of ranked deals.

Thus, as shown in block 1006 of FIG. 10, an apparatus, such as thepromotional system 310, may include means, such as the demand module102, the processor 302 or the like, for scoring each of one or morevirtual offers.

The scoring may be configured to score the plurality of virtual offersbased on explicit input by the consumer and/or extracted features fromthe consumer information. In the instance where the consumer selectscertain attributes of desired virtual offers, the selected attributes ofthe desired offers may be used at different points in the rankingprocess 1000. For example, process 1000 may select only the virtualoffers that meet the attributes as selected by the consumer. So that,the entire universe of virtual offers for scoring/review by the process1000 may be dictated by the consumer. In another embodiment, process1000 may factor in the consumer's desired attributes at a later point.In particular, the process 1000 may weigh the score depending on thedesired consumer attributes (such as improving the score of a virtualoffer that is characterized as a “family offer” if the consumer hasselected as an offer attribute “family offers” type). In addition tousing the desired attributes as selected by the consumer, the process1000 may examine other attributes of the consumer and attributes of theplurality of virtual offers to score the plurality of virtual offers. Ifthe consumer has not indicated a set of desired attributes, the process1000 may examine attributes of the consumer in the consumer profile inorder to evaluate which virtual offers to select for scoring andranking.

Block 1006 may be configured to predict the likelihood that a particularconsumer will purchase a particular offer that is offered to theconsumer. The indication of acceptance of the virtual offer may take oneof several forms, such as the conversion rate (the rate by which aconsumer accepts a virtual offer that is offered or the number ofpurchases of the virtual offer divided by the number of times thevirtual offer is offered to consumers) or another type of relevancescore. Block 1006 may be organized into different categories ofconsumers correlated with different categories (and subcategories) ofvirtual offer types. For example, the scoring model may aggregate thehistorical data from previously-run virtual offers and/or historicaldata from the virtual offer under consideration, organizing features ofconsumers (such as gender and distance from a virtual offer) with theconversion rates for categories/subcategories of virtual offers. Inparticular, Block 1006 may be segmented by consumers (such as males 0-2miles from the virtual offer, males 2-4 miles from the virtual offer,etc.) and segmented by virtual offers in differentcategories/subcategories (such as the category of restaurants, and thesubcategories of Italian restaurants, Greek restaurants, etc.). Block1006 may aggregate the data from the previous virtual offers in order togenerate the conversion rates for the consumers in the differentcategories (such as the conversion rate for consumers that are males 2-4miles from a Greek restaurant virtual offer in Chicago). The examples ofthe categories of consumers and the categories/subcategories of virtualoffers are merely for illustration purposes only. Other categories arecontemplated. For example, the categories of consumers may be subdividedinto gender, distance, and age. As another example, Block 1006 may besubdivided based on price of the virtual offer. The results of the Block1006 may be input to Block 1008, which may generate a ranked list ofvirtual offers according to the results.

As shown in block 1008 of FIG. 10, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for ranking each of one or more virtualoffers.

The results of Blocks 1006 and 1008 may generate a ranked list ofvirtual offers, which may thereafter be iteratively re-ranked accordingto further analysis of consumer data and/or virtual offer data.Alternatively, Block 1006 may output the scores for the multiple virtualoffers, and the scores may be iteratively modified (such as re-scored).After the final iteration, the scores may then be used to generate afinal ranking of some or all of the virtual offers in order to determinewhat virtual offer(s) to present to the consumer.

As shown in block 1010 of FIG. 10, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for adjusting the rankings of the one or morevirtual offers based on past purchase history information.

As shown in Block 1010, an adjustment may account for the consumer'spast purchase history by accessing a past purchase database in order togenerate a first reordered list of deals. Alternatively, the consumer'spast purchase history may be used to modify the initial scores. Forexample, a past purchase database may be part of the consumerinformation database 112 and indicate which categories (orsubcategories) of offers that the particular consumer previouslypurchased. The fact that the particular consumer has (or has not)previously purchased may be used in order to reorder the ranked list ofvirtual offers. For example, the ranked list of virtual offers for theparticular consumer may include the top “X” virtual offers, with each ofthe top “X” virtual offers having a particular category and subcategory.In the event that the consumer has previously purchased an offer in asubcategory for one (or more) of the top “X” virtual offers, the scoresassociated with those virtual offers may be modified (such as bymultiplying the score with a previous-purchase correction factor).Alternatively or in addition, in the event that the consumer has notpreviously purchased an offer in a subcategory for one (or more) of thetop “X” virtual offers, the scores associated with those deals may bemodified (such as by multiplying the score with a no-previous-purchasecorrection factor).

As shown in block 1012 of FIG. 10, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for adjusting the rankings of the one or morevirtual offers based on one or more business rules.

Block 1012 may account for particular business needs. Examples ofbusiness rules include, but are not limited to: rerunning an offer;offer de-duplicating; filtering targeted-only offers; and limitingextended access offers. Rerunning an offer may include running an offerpreviously run within a predetermined time period (such as 2 days ago, 2weeks ago, etc.). The algorithm may be programmed with a business rulein which offers are calculated for consumers who have not seen the offerbefore or who have not purchased the offer before. The time period thealgorithm examines may look back in time a predetermined amount, such as3 months. If the consumer has this offer as the top rank, and theconsumer has seen this type of offer before (or has purchased this typeof offer), then the consumer is shown something else.

Offer de-duplicating is a business rule that seeks to reduce sending ofduplicate offers to a consumer. De-duplicating may come in one ofseveral forms. One form is de-duplicating across a business (e.g., aparticular business may be running two virtual offers and the algorithmonly calculates the consumer probability for one of them (w/in aparticular time period). Another form is de-duplicating across the typeof virtual offer. It is possible to “clone” a virtual offer, such as byissuing the same virtual offer in multiple contexts (e.g., running atravel virtual offer in getaways and leisure). The algorithm may accountfor a previous purchase of an offer, and prevent calculation in adifferent context.

Filtering targeted-only virtual offers may occur when certain virtualoffers are filtered or removed from consideration or scoring. Somevirtual offers may be designated for specific targeting and are notconsidered in scoring. These virtual offers may be removed from thealgorithm process and give special consideration. These speciallyconsidered virtual offers may be tagged as such so that the algorithmdoes not analyze them.

Further, as shown in block 1014 of FIG. 10, an apparatus, such as thepromotional system 310, may include means, such as the demand module102, the processor 302 or the like, for adjusting the rankings of theone or more virtual offers based on desired placement constraints. Forexample, if it is desired that a certain maximum number or minimumnumber of people receive the virtual offer, the algorithm may bemodified or overridden. In particular, if it is desired that 500,000people receive the virtual offer, and the algorithm only selects 400,000people, the algorithm may be modified (such as the thresholds to issue avirtual offer, or a re-ranking of virtual offers) in order to issue thevirtual offer to the 500,000.

As shown in block 1016 of FIG. 10, an apparatus, such as the promotionalsystem 310, may include means, such as the demand module 102, theprocessor 302 or the like, for adjusting the rankings of the one or morevirtual offers based on diversity constraint information. Diversityconstraints may comprise giving pre-determined weight to specificcategories, sub-categories, locations, and/or price ranges.

Other iterations and potential correction factors are contemplated. Forexample, an interaction accounting for price of a virtual offer and aprice correction factor may be used. In one embodiment, virtual offersare scored and sorted based on an expected conversion rate. Price of thevirtual offers may be accounted thereafter by applying a priceadjustment factor, whereby the predicted conversion rate is adjusted bythe price of the virtual offer (such by multiplying the predictedconversion rate by the price of the virtual offer). In this way, thescoring and/or ranking of the virtual offers may be used to increase ormaximize revenue. The scoring and ranking may provide initial scores tothe multiple virtual offers. In an alternate embodiment, the scoring andranking may be used after the initial scoring of the multiple virtualoffers, so that the scoring and ranking may be used to adjust or modifyprevious scores or rankings.

Supply Source Quality Score Calculation Example

FIG. 11 shows an example method, namely process 1100, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to calculate a supply sourcequality score, in accordance with some embodiments discussed herein. Asshown in block 1102 of FIG. 11, an apparatus, such as the promotionalsystem 310, may be include means, such as the supply ID module 104, theprocessor 302, or the like, for determining if a supply source has anoverall star average greater than or equal to at least a 3.0 withgreater than or equal to at least 5 total reviews.

If the determination at block 1102 yields a yes, the process 1100proceeds to block 1104. As shown in block 1104 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has an overall star average greater than or equal to atleast a 4.5 with greater than or equal to at least 500 total numberreviews.

If the determination at block 1104 yields a yes, the process 1100proceeds to block 1106. As shown in block 1106 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has a positive press review or award from an acceptedsource.

If the determination at block 1106 yields a yes, the process 1100proceeds to block 1108. As shown in block 1108 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for assigning asupply source a score of 10.

If the determination at block 1104 yields a no, the process 1100proceeds to block 1110. As shown in block 1110 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has an overall star average greater than or equal to atleast a 4.0 with greater than or equal to at least 20 total reviews.

If the determination at block 1110 yields a yes, the process 1100proceeds to block 1112. As shown in block 1112 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for assigning asupply source a score of 8.

If the determination at block 1110 yields a no, the process 1100proceeds to block 1114. As shown in block 1114 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has an overall star average of greater than or equal toat least a 4.0 with greater than or equal to at least 5,000 “likes”,such as for example, Facebook® “likes”.

If the determination at block 1114 yields a yes, the process 1100proceeds to block 1112, where the supply source is assigned a score of8. If the determination at block 1114 yields a no, the process 1100proceeds to block 1116. As shown in block 1116 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for assigning asupply source a score of 6.

If the determination at block 1102 yields a no, the process 1100proceeds to block 1118. As shown in block 1118 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has an overall star rating of less than or equal to atleast a 2.49 with greater than or equal to at least 5 total reviews.

If the determination at block 1118 yields a yes, the process 1100proceeds to block 1120. As shown in block 1120 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for assigning asupply source a score of 1.

If the determination at block 1118 yields a no, the process 1100proceeds to block 1122. As shown in block 1122 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has an overall star average of greater than or equal toat least a 3.0.

If the determination at block 1122 yields a no, the process 1100proceeds to block 1124. As shown in block 1124 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for assigning asupply source a score of 4.

If the determination at block 1122 yields a yes, the process 1100proceeds to block 1126. As shown in block 1126 of FIG. 11, an apparatus,such as the promotional system 310, may be include means, such as thesupply ID module 104, the processor 302, or the like, for determining ifa supply source has an a positive press review or award from anacceptable source and has greater than or equal to at least 5,000“likes”, such as for example, Facebook® “likes”.

If the determination at block 1126 yields a no, the process 1100proceeds to block 1124 where the supply source is assigned a score of 4.If the determination at block 1126 yields a yes, the process 1100proceeds to block 1114.

As shown in block 1128 of FIG. 11, an apparatus, such as the promotionalsystem 310, may be include means, such as the supply ID module 104, theprocessor 302, or the like, for determining if a supply source is closedor determining if a supply source is closed is impossible. If block 1128determines that a supply source is closed or cannot tell if the supplysource is closed, the process 1100 proceeds to block 1120 where thesupply source is assigned a score of 1.

Calculating an Assignment Probability Number

FIG. 12 shows an example method, namely process 1200, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to calculate or determine anassignment probability number for each of one or more sales resourcesfor assignment purposes, in accordance with some embodiments discussedherein. As shown in block 1202 of FIG. 12, an apparatus, such as thepromotional system 310, may be include means, such as the assignmentmodule 106, the processor 302, or the like, for receiving a prioritizedlist of supply sources.

As shown in block 1204 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for accessing a first supply source forassignment.

As shown in block 1206 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for resetting the assignment probabilitynumbers for each of one or more sales resources.

As shown in block 1208 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for considering each sales resource forassignment.

As shown in block 1210 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether a capacity of asales resource meets a predetermined threshold. For example, a salesresource with the required amount of supply sources in their prioritizedcall list may have zero capacity whereas a sales resource with only 90%of the required supply sources in their prioritized call list will havea higher capacity than zero.

If the determination in block 1210 yields a no, the process 1200 thengoes to block 1212. As shown in block 1212 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1210 yields a yes, the process 1200 thengoes to block 1214. As shown in block 1214 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1216 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the portfolio mix ofthe sales resource meet a predetermined threshold in one or more of thecategory, sub-category, location, hyper-local region and price of thesupply source.

If the determination in block 1216 yields a no, the process 1200 thengoes to block 1218. As shown in block 1218 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1216 yields a yes, the process 1200 thengoes to block 1220. As shown in block 1220 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1222 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the experienceand/or expertise of the sales resource meet a predetermined threshold inone or more of the category, sub-category, location, hyper-local regionand price of the supply source. In one example, the lead allocationprocess seeks to distinguish between experience with new supply sourcesand supply sources with which a relationship already exists. In oneembodiment, experience and/or expertise of a sales resource mayadditionally or alternatively, indicate or distinguish experience and/orexpertise with providers with which the promotion and marketing systemhas no existing relationship and providers with which the promotion andmarketing system does have a previous and/or existing relationship. Forexample, a sales resource who has more success (relatively) in closingproviders who have never offered a promotion with the promotion andmarketing system will have an experience and expertise score thatreflects that information and thus, are more likely to be assigned newproviders. Additionally or alternatively, a sales resource who has moresuccess (relatively) in extending past or existing relationships withproviders may have an experience and/or expertise score reflecting thatinformation and may be more likely to be assigned providers with which arelationship exists.

In another embodiment, the lead allocation process seeks to optimizetravel time for sales resources. In an example embodiment, an experienceor expertise score may reflect a higher level or score for providers ina specific location or hyper local region. In another embodiment, anexperience and/or expertise level and/or score may be affected by thelocations and/or hyper local regions of other providers on a salesresource's provider list. For example, if provider A is already assignedto a sales resource, the sales resource may be more likely to beassigned provider B, who is closer to provider A, than a provider C, whois further away from provider A. Such assignment may be implemented inan embodiment in which an experience and/or expertise score and/level isadjusted based on the locations and/or hyper local regions of providersalready assigned to the sales resource.

In another embodiment, in terms of expertise, a sales resource mayspecialize in quickly closing new providers or reaching out to providersin order to fulfill demand. For example, providers who contact thepromotion and marketing service are thought to be interested in workingwith the promotion and marketing service and thus, may be more likely tobe assigned to a sales resource, for example a team that specializes inquickly closing and getting those providers closed.

If the determination in block 1222 yields a yes, the process 1200 thengoes to block 1224. As shown in block 1224 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1222 yields a no, the process 1200 thengoes to block 1226. As shown in block 1226 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1228 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the supply sourcewould rank higher in the prioritized call list of the sales resourcethan it would in an average prioritized call list.

If the determination in block 1228 yields a no, the process 1200 thengoes to block 1230. As shown in block 1230 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1228 yields a yes, the process 1200 thengoes to block 1232. As shown in block 1232 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1234 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the sales resourcehas a relationship with the supply source.

If the determination in block 1234 yields a yes, the process 1200 thengoes to block 1236. As shown in block 1236 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1234 yields a no, the process 1200 thengoes to block 1238. As shown in block 1238 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1240 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the supply sourcehas ever been de-allocated form the sales resource.

If the determination in block 1240 yields a no, the process 1200 thengoes to block 1242. As shown in block 1242 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1240 yields a yes, the process 1200 thengoes to block 1244. As shown in block 1244 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1246 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the sales resourcereceived the previous supply source.

If the determination in block 1246 yields a no, the process 1200 thengoes to block 1248. As shown in block 1248 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1246 yields a yes, the process 1200 thengoes to block 1250. As shown in block 1250 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1252 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for determining whether the prioritized calllist of the sales resource meets a predetermined threshold for newsupply sources.

If the determination in block 1252 yields a no, the process 1200 thengoes to block 1254. As shown in block 1254 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1252 yields a yes, the process 1200 thengoes to block 1256. As shown in block 1256 of FIG. 12, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1258 of FIG. 12, an apparatus, such as the promotionalsystem 310, may be include means, such as the assignment module 106, theprocessor 302, or the like, for assigning a supply source to salesresource based on the assignment probability number of each of one ormore sales resources.

Example De-Allocation Process

FIG. 13 shows an example method, namely process 1300, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to determine whether and whento de-allocate a supply source from a sales resource, in accordance withsome embodiments discussed herein. As shown in block 1302 of FIG. 13, anapparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining whether a supply source has an unexpired promotion.

If the determination in block 1302 yields a yes, the process 1300 thengoes to block 1304. As shown in block 1304 of FIG. 13, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for determiningwhether the sales resource has left the company.

If the determination in block 1304 yields a yes, the process 1300 thengoes to block 1306. As shown in block 1306 of FIG. 13, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for de-allocatingthe supply source. The supply source may then be re-scored and/orre-assigned.

If the determination in block 1304 yields a no, the process 1300 thengoes to block 1308. As shown in block 1308 of FIG. 13, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for determiningthat the supply source is not to be de-allocated at the current time.The process may then return to block 1302.

If the determination in block 1302 yields a no, the process 1300 thengoes to block 1310. As shown in block 1310 of FIG. 13, an apparatus,such as the promotional system 310, may be include means, such as theassignment module 106, the processor 302, or the like, for determining,in an instance in which a supply source has a warm lead, whether thesales resource has contacted the supply source within 2 days.

If the determination in block 1310 yields a no, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1310 yields a yes or not applicable, theprocess 1300 then goes to block 1312. As shown in block 1312 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining, in an instance in which a supply source does not have awarm lead, whether the sales resource has contacted the supply sourcewithin 10 days.

If the determination in block 1312 yields a no, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1312 yields a yes or not applicable, theprocess 1300 then goes to block 1314. As shown in block 1314 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining whether a sales resource has made contact within 35 dayssince a previous promotion expired.

If the determination in block 1314 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1314 yields a no or not applicable, theprocess 1300 then goes to block 1316. As shown in block 1316 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining whether a sales resource has made traction meeting apredetermined threshold within 60 days since a previous promotionexpired.

If the determination in block 1316 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1316 yields a no or not applicable, theprocess 1300 then goes to block 1318. As shown in block 1318 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining, for supply sources having scores above a predeterminedthreshold and where sales resource has not previously closed a contractwith the supply source, whether the sales resource has not closed acontract within 120 days.

If the determination in block 1318 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1318 yields a no or not applicable, theprocess 1300 then goes to block 1320. As shown in block 1318 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining, for supply sources having scores below a predeterminedthreshold and where sales resource has not previously closed a contractwith the supply source, whether the sales resource has not closed acontract within 90 days.

If the determination in block 1320 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1320 yields a no or not applicable, theprocess 1300 then goes to block 1322. As shown in block 1322 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining, for supply sources having scores above a predeterminedthreshold and where sales resource has previously closed a contract withthe supply source, if the sales resource has not closed a contractwithin 180 days.

If the determination in block 1322 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1322 yields a no or not applicable, theprocess 1300 then goes to block 1324. As shown in block 1324 of FIG. 13,an apparatus, such as the promotional system 310, may be include means,such as the assignment module 106, the processor 302, or the like, fordetermining, for supply sources having scores below a predeterminedthreshold and where sales resource has previously closed a contract withthe supply source, if the sales resource has not closed a contractwithin 120 days.

If the determination in block 1324 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1324 yields a no or not applicable, theprocess 1300 may end. Process 1300 may also determine that the supplysource is not to be de-allocated and/or return to block 1302.

As will be appreciated, any such computer program instructions and/orother type of code may be loaded onto a computer, processor or otherprogrammable apparatus's circuitry to produce a machine, such that thecomputer, processor other programmable circuitry that execute the codeon the machine create the means for implementing various functions,including those described herein.

As described above and as will be appreciated based on this disclosure,embodiments of the present invention may be configured as methods,mobile devices, backend network devices, and the like. Accordingly,embodiments may comprise various means including entirely of hardware orany combination of software and hardware. Furthermore, embodiments maytake the form of a computer program product on at least onenon-transitory computer-readable storage medium having computer-readableprogram instructions (e.g., computer software) embodied in the storagemedium. Any suitable computer-readable storage medium may be utilizedincluding non-transitory hard disks, CD-ROMs, flash memory, opticalstorage devices, or magnetic storage devices.

Embodiments of the present invention have been described above withreference to block diagrams and flowchart illustrations of methods,apparatuses, systems and computer program products. It will beunderstood that each block of the circuit diagrams and processflowcharts, and combinations of blocks in the circuit diagrams andprocess flowcharts, respectively, can be implemented by various meansincluding computer program instructions. These computer programinstructions may be loaded onto a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the computer program product includes theinstructions which execute on the computer or other programmable dataprocessing apparatus create a means for implementing the functionsspecified in the flowchart block or blocks.

These computer program instructions may also be stored in acomputer-readable storage device that can direct a computer or otherprogrammable data processing apparatus to function in a particularmanner, such that the instructions stored in the computer-readablestorage device produce an article of manufacture includingcomputer-readable instructions for implementing the function discussedherein. The computer program instructions may also be loaded onto acomputer or other programmable data processing apparatus to cause aseries of operational steps to be performed on the computer or otherprogrammable apparatus to produce a computer-implemented process suchthat the instructions that execute on the computer or other programmableapparatus provide steps for implementing the functions discussed herein.

Accordingly, blocks of the block diagrams and flowchart illustrationssupport combinations of means for performing the specified functions,combinations of steps for performing the specified functions and programinstruction means for performing the specified functions. It will alsobe understood that each block of the circuit diagrams and processflowcharts, and combinations of blocks in the circuit diagrams andprocess flowcharts, can be implemented by special purpose hardware-basedcomputer systems that perform the specified functions or steps, orcombinations of special purpose hardware and computer instructions.

Many modifications and other embodiments of the inventions set forthherein will come to mind to one skilled in the art to which theseembodiments of the invention pertain having the benefit of the teachingspresented in the foregoing descriptions and the associated drawings.Therefore, it is to be understood that the embodiments of the inventionare not to be limited to the specific embodiments disclosed and thatmodifications and other embodiments are intended to be included withinthe scope of the appended claims. Although specific terms are employedherein, they are used in a generic and descriptive sense only and notfor purposes of limitation.

That which is claimed:
 1. A method for assigning one or more merchantsto one or more sales resources, the method comprising: receiving, by apromotion and marketing system comprising one or more processors, a listof merchant data, wherein the list of merchant data comprises: one ormore merchants; and for each of the one or more merchants, (i) a salesvalue score that is based on an expected booking amount, (ii) a list ofone or more virtual offers for which the merchant is identified as ableto meet, (iii) a list of one or more real promotions correlated to theat least one of the plurality virtual offers in accordance with pricedata, product category or service category data, and location data, (iv)a quantity of each of the one or more virtual offers that the merchantis able to meet based on an availability of the one or more realpromotions, and (v) contact information; accessing, by the one or moreprocessors, sales resource data from a sales resource database, thesales resource data indicative of a plurality of sales resourcesresponsible for closing contracts with the one or more merchants, thesales resource data comprising at least the plurality of sales resourcesand an associated capacity for contacting one or more merchants;performing, by the one or more processors, an iterative assignmentprocess; generating, by the one or more processors, a plurality ofprioritized call lists, wherein plurality of prioritized call listscomprises at least one prioritized call list for each of the pluralityof sales resources, wherein the prioritized call list comprises merchantdata associated with each merchant assigned to a respective salesresource during the iterative assignment process, each merchant uniqueto the respective sales resource; causing, by the one or moreprocessors, display of the unique prioritized call list associated withthe first sales resource upon access to the promotion and marketingsystem by the first sales resource; dynamically modifying, by the one ormore processors, one or more assignments based on an update to a currentinventory; and regenerating at least one of the plurality of prioritizedcall lists based on the dynamically modified one or more assignments andthe update to the current inventory.
 2. The method of claim 1, whereinthe iterative assignment process comprises: calculating, for each of theplurality of sales resources, an assignment probability number based onthe associated capacity, wherein the assignment probability numberrepresents a probability that a sales resource will be randomly assigneda next merchant from the one or more merchants; determining a nextmerchant from the one or more merchants to be assigned; assigningmerchant data associated with the next merchant from the one or moremerchants to a unique prioritized call list associated with a firstsales resource in accordance with at least the assignment probabilitynumber of each of the one or more sales resources; and adjusting theassociated capacity of the first resource while maintaining theassociated capacity of each remaining sales resource of the plurality ofresources.
 3. The method of claim 2, and wherein calculation, for eachof the plurality of resources, of the assignment probability numbercomprises: determining whether the associated capacity of a salesresource meets a predetermined threshold; and in an instance in whichthe determination yields a result indicative of the associated capacityof the sales resource failing to meet the predetermined threshold,increasing the assignment probability number.
 4. The method of claim 2,wherein the one or more merchants are prioritized by the sales valuescore.
 5. The method of claim 1, wherein the assignment probabilitynumber is further based on sales resource data indicative of a salesresource expertise score for at least one of: category, sub-category, orlocation.
 6. The method of claim 1, wherein the assignment probabilitynumber is further based on a predetermined portfolio mix and previouslyassigned merchants in the prioritized call list.
 7. The method of claim1, wherein the modification of the one or more assignments and one ormore of the plurality of the unique prioritized call lists based on theupdate to the current inventory is based on a re-calculation of ademand, and a determination that there is no longer the demand foradditional units of a particular service, good or experience provided bya particular merchant.
 8. A computer program product for assigning oneor more merchants to one or more sales resources, the computer programproduct comprising at least one non-transitory computer-readable storagemedium having computer-executable program code instructions storedtherein, the computer-executable program code instructions comprisingprogram code instructions for: receiving, by a promotion and marketingsystem comprising one or more processors, a list of merchant data,wherein the list of merchant data comprises: one or more merchants; andfor each of the one or more merchants, (i) a sales value score that isbased on an expected booking amount, (ii) a list of one or more virtualoffers for which the merchant is identified as able to meet, (iii) alist of one or more real promotions correlated to the at least one ofthe plurality virtual offers in accordance with price data, productcategory or service category data, and location data, (iv) a quantity ofeach of the one or more virtual offers that the merchant is able to meetbased on an availability of the one or more real promotions, and (v)contact information; accessing, by the one or more processors, salesresource data from a sales resource database, the sales resource dataindicative of a plurality of sales resources responsible for closingcontracts with the one or more merchants, the sales resource datacomprising at least the plurality of sales resources and an associatedcapacity for contacting one or more merchants; performing, by the one ormore processors, an iterative assignment process; generating, by the oneor more processors, a plurality of prioritized call lists, whereinplurality of prioritized call lists comprises at least one prioritizedcall list for each of the plurality of sales resources, wherein theprioritized call list comprises merchant data associated with eachmerchant assigned to a respective sales resource during the iterativeassignment process, each merchant unique to the respective salesresource; causing, by the one or more processors, display of the uniqueprioritized call list associated with the first sales resource uponaccess to the promotion and marketing system by the first salesresource; dynamically modifying, by the one or more processors, one ormore assignments based on an update to a current inventory; andregenerating at least one of the plurality of prioritized call listsbased on the dynamically modified one or more assignments and the updateto the current inventory.
 9. The computer program product of claim 8,wherein the iterative assignment process comprises: calculating, foreach of the plurality of sales resources, an assignment probabilitynumber based on the associated capacity, wherein the assignmentprobability number represents a probability that a sales resource willbe randomly assigned a next merchant from the one or more merchants;determining a next merchant from the one or more merchants to beassigned; assigning merchant data associated with the next merchant fromthe one or more merchants to a unique prioritized call list associatedwith a first sales resource in accordance with at least the assignmentprobability number of each of the one or more sales resources; andadjusting the associated capacity of the first resource whilemaintaining the associated capacity of each remaining sales resource ofthe plurality of resources.
 10. The computer program product of claim 9,and wherein calculation, for each of the plurality of resources, of theassignment probability number comprises: determining whether theassociated capacity of a sales resource meets a predetermined threshold;and in an instance in which the determination yields a result indicativeof the associated capacity of the sales resource failing to meet thepredetermined threshold, increasing the assignment probability number.11. The computer program product of claim 9, wherein the one or moremerchants are prioritized by the sales value score.
 12. The computerprogram product of claim 8, wherein the assignment probability number isfurther based on sales resource data indicative of a sales resourceexpertise score for at least one of: category, sub-category, orlocation.
 13. The computer program product of claim 8, wherein theassignment probability number is further based on a predeterminedportfolio mix and previously assigned merchants in the prioritized calllist.
 14. The computer program product of claim 8, wherein themodification of the one or more assignments and one or more of theplurality of the unique prioritized call lists based on the update tothe current inventory is based on a re-calculation of a demand, and adetermination that there is no longer the demand for additional units ofa particular service, good or experience provided by a particularmerchant.
 15. An apparatus for assigning one or more merchants to one ormore sales resources, the apparatus comprising at least one processorand at least one memory including computer program code, the at leastone memory and the computer program code configured to, with theprocessor, cause the apparatus to at least: receive, by a promotion andmarketing system comprising one or more processors, a list of merchantdata, wherein the list of merchant data comprises: one or moremerchants; and for each of the one or more merchants, (i) a sales valuescore that is based on an expected booking amount, (ii) a list of one ormore virtual offers for which the merchant is identified as able tomeet, (iii) a list of one or more real promotions correlated to the atleast one of the plurality virtual offers in accordance with price data,product category or service category data, and location data, (iv) aquantity of each of the one or more virtual offers that the merchant isable to meet, and (v) contact information; accessing, by the one or moreprocessors, sales resource data from a sales resource database, thesales resource data indicative of a plurality of sales resourcesresponsible for closing contracts with the one or more merchants, thesales resource data comprising at least the plurality of sales resourcesand an associated capacity for contacting one or more merchants;perform, by the one or more processors, an iterative assignment process;generate, by the one or more processors, a plurality of prioritized calllists, wherein plurality of prioritized call lists comprises at leastone prioritized call list for each of the plurality of sales resources,wherein the prioritized call list comprises merchant data associatedwith each merchant assigned to a respective sales resource during theiterative assignment process, each merchant unique to the respectivesales resource; cause, by the one or more processors, display of theunique prioritized call list associated with the first sales resourceupon access to the promotion and marketing system by the first salesresource; dynamically modify, by the one or more processors, one or moreassignments based on an update to a current inventory; and regenerate atleast one of the plurality of prioritized call lists based on thedynamically modified one or more assignments and the update to thecurrent inventory.
 16. The apparatus of claim 15, wherein the computerprogram code configured to perform the iterative assignment processcomprises computer program code configured to, with the processor, causethe apparatus to at least: calculate, for each of the plurality of salesresources, an assignment probability number based on the associatedcapacity, wherein the assignment probability number represents aprobability that a sales resource will be randomly assigned a nextmerchant from the one or more merchants; determine a next merchant fromthe one or more merchants to be assigned; assign merchant dataassociated with the next merchant from the one or more merchants to aunique prioritized call list associated with a first sales resource inaccordance with at least the assignment probability number of each ofthe one or more sales resources; and adjust the associated capacity ofthe first resource while maintaining the associated capacity of eachremaining sales resource of the plurality of resources.
 17. Theapparatus of claim 16, and wherein the computer program code configuredto calculate, for each of the plurality of resources, the assignmentprobability number comprises computer program code configured to, withthe processor, cause the apparatus to at least: determine whether theassociated capacity of a sales resource meets a predetermined threshold;and in an instance in which the determination yields a result indicativeof the associated capacity of the sales resource failing to meet thepredetermined threshold, increase the assignment probability number. 18.The apparatus of claim 16, wherein the one or more merchants areprioritized by the sales value score.
 19. The apparatus of claim 15,wherein the assignment probability number is further based on salesresource data indicative of a sales resource expertise score for atleast one of: category, sub-category, or location.
 20. The apparatus ofclaim 15, wherein the assignment probability number is further based ona predetermined portfolio mix and previously assigned merchants in theprioritized call list.
 21. The apparatus of claim 15, wherein themodification of the one or more assignments and one or more of theplurality of the unique prioritized call lists based on the update tothe current inventory is based on a re-calculation of a demand, and adetermination that there is no longer the demand for additional units ofa particular service, good or experience provided by a particularmerchant.